Principles of runtime support for parallel processors

Ravi Mirchandaney, Joel H. Saltz, Roger M. Smith, David M. Nicol, Kay Crowley

Research output: Chapter in Book/Report/Conference proceedingConference contribution


There exists substantial data level parallelism in scientific problems. The PARTY runtime system is an attempt to obtain efficient parallel implementations for scientific computations, particularly those where the data dependencies are manifest only at runtime. This can preclude compiler based detection of certain types of parallelism. The automated system is structured as follows: An appropriate level of granularity is first selected for the computations. A directed acyclic graph representation of the program is generated on which various aggregation techniques may be employed in order to generate efficient schedules. These schedules are then mapped onto the target machine. We describe some initial results from experiments conducted on the Intel Hypercube and the Encore Multimax that indicate the usefulness of our approach.

Original languageEnglish (US)
Title of host publicationProceedings of the 2nd International Conference on Supercomputing, ICS 1988
EditorsJ. Lenfant
PublisherAssociation for Computing Machinery
Number of pages13
ISBN (Electronic)0897912721
StatePublished - Jun 1 1988
Externally publishedYes
Event2nd International Conference on Supercomputing, ICS 1988 - St. Malo, France
Duration: Jul 4 1988Jul 8 1988

Publication series

NameProceedings of the International Conference on Supercomputing
VolumePart F130184


Other2nd International Conference on Supercomputing, ICS 1988
CitySt. Malo

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'Principles of runtime support for parallel processors'. Together they form a unique fingerprint.

Cite this