The solution of large and sparse models presents in many ways a suitable structure for implementation on parallel computers. However, efficient use of these computing devices requires that the code be specifically structured in order to exploit the particular type of parallel computer used. This article discusses the implementation of data parallel processing algorithms as well as performance results based on the solution of a macroeconometric model on a Connection Machine 2.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: 14 pages Date of creation: 1993 Date of revision: Handle: RePEc:gen:geneem:93.07
Contact details of provider: Postal: 40 Boulevard du Pont-d'Arve, CH-1211 Geneva 4, Switzerland Phone: +41 22 379-8200 Fax: +41 22 379-8299 Email: Web page: http://www.unige.ch/ses/metri/
For technical questions regarding this item, or to correct its listing, contact: () The email address of this maintainer does not seem to be valid anymore. Please ask to update the entry or send us the correct address..
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)