Actions for Execution models for mapping programs onto distributed memory parallel computers

Email RIS file
Bookmark
Report an Issue

Execution models for mapping programs onto distributed memory parallel computers

Author
Sussman, Alan
Published
Mar 1, 1992.
Physical Description
1 electronic document
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
The problem of exploiting the parallelism available in a program to efficiently employ the resources of the target machine is addressed. The problem is discussed in the context of building a mapping compiler for a distributed memory parallel machine. The paper describes using execution models to drive the process of mapping a program in the most efficient way onto a particular machine. Through analysis of the execution models for several mapping techniques for one class of programs, we show that the selection of the best technique for a particular program instance can make a significant difference in performance. On the other hand, the results of benchmarks from an implementation of a mapping compiler show that our execution models are accurate enough to select the best mapping technique for a given program.
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19920012008.
Accession ID: 92N21251.
NAS 1.26:189613.
AD-A248144.
ICASE-92-8.
NASA-CR-189613.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15676774