Work distribution in parallel programs for distributed memory multiprocessors

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

One of the most important issues in parallel programming for distributed memory multiprocessors is to distribute data and work in a cooperative way, so that data are mostly available where they are needed. This paper discusses masking, a technique to distribute work among parallel processes running on a distributed memory multiprocessor. This technique was developed for the par allegation of Fortran 77 programs for the SUPRENUM supercomputer. In the semi-automatic parallelization system SUPERB we implemented masking on the basis of a user defined data distribution. Both concepts, data and work distribution, are very general concepts and can be applied to parallel programs for all kinds of multiprocessors based on memory hierarchies.

Original languageEnglish
Title of host publicationICS 1991 - Proceedings of the 5th International Conference on Supercomputing
EditorsEdward S. Davidson, Friedel Hossfield
PublisherAssociation for Computing Machinery
Pages96-104
Number of pages9
ISBN (Print)0897914341, 9780897914345
DOIs
StatePublished - 1 Jun 1991
Externally publishedYes
Event5th International Conference on Supercomputing, ICS 1991 - Cologne, Germany
Duration: 17 Jun 199121 Jun 1991

Publication series

NameProceedings of the International Conference on Supercomputing

Conference

Conference5th International Conference on Supercomputing, ICS 1991
Country/TerritoryGermany
CityCologne
Period17/06/9121/06/91

Keywords

  • Analysis of algorithms
  • Multiprocessors
  • Program transformations

Fingerprint

Dive into the research topics of 'Work distribution in parallel programs for distributed memory multiprocessors'. Together they form a unique fingerprint.

Cite this