@inproceedings{50a89831ba3a4c8ea8a0f034c022e98c,
title = "Principles of runtime support for parallel processors",
abstract = "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.",
author = "Ravi Mirchandaney and Saltz, {Joel H.} and Smith, {Roger M.} and Nicol, {David M.} and Kay Crowley",
note = "Funding Information: *This work was supported by the U.S. Office of Naval Research under Grant N00014-86-K-0564. {\textquoteleft}t Supported by NASA Grant NASI-18107 while consulting at ICASE, NASA Langely Research Center, Hampton, VA 23185 Publisher Copyright: {\textcopyright} 1988 ACM.; 2nd International Conference on Supercomputing, ICS 1988 ; Conference date: 04-07-1988 Through 08-07-1988",
year = "1988",
month = jun,
day = "1",
doi = "10.1145/55364.55378",
language = "English (US)",
series = "Proceedings of the International Conference on Supercomputing",
publisher = "Association for Computing Machinery",
pages = "140--152",
editor = "J. Lenfant",
booktitle = "Proceedings of the 2nd International Conference on Supercomputing, ICS 1988",
}