Runtime compilation techniques for data partitioning and communication schedule reuse
- Univ. of Maryland, College Park, MD (United States). Computer Science Dept.
- Syracuse Univ., NY (United States). Northeast Parallel Architectures Center
In this paper, the authors describe two new ideas by which HPF compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of compiler directives. The directives allow the user to use program arrays to describe graph connectivity, spatial location of array elements and computational load. The second is a simple conservative method that in many cases enables a compiler to recognize that it is possible to reuse previously computed results from inspectors (e.g. communication schedules, loop iteration partitions, information that associates off-processor data copies with on-processor buffer locations). They present performance results for these mechanisms from a Fortran 90D compiler implementation.
- OSTI ID:
- 46231
- Report Number(s):
- CONF-931115-; TRN: IM9522%%233
- Resource Relation:
- Conference: Supercomputing conference on high performance computing and communications, Portland, OR (United States), 15-19 Nov 1993; Other Information: PBD: 1993; Related Information: Is Part Of Supercomputing `93: Proceedings; PB: 961 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fortran 90D/HPF compiler for distributed memory MIMD computers: Design, implementation, and performance results
Compiler and runtime support for structured and block structured applications