Massively Parallel Implementation of the Splitting Equilibration Algorithm
In this paper, we describe a massively parallel implementation of the Splitting Equilibration Algorithm using CM FORTRAN on the Thinking Machines CM-2 system. Numerical results using upwards of 32 768 (32 K) processors on the CM-2 system, the Connection Machine, are presented for both input/output and social accounting matrix estimation problems and compared with those obtained for the same problems on the IBM 3090. Our experiences with the relative ease/difficulty of the implementations on these fine-grain parallel architectures are also presented and discussed. Citation Copyright 1993 by Kluwer Academic Publishers.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 6 (1993)
Issue (Month): 3-4 (November)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=100248|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:6:y:1993:i:3-4:p:151-61. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.