Sciweavers

SC
1993
ACM

Runtime compilation techniques for data partitioning and communication schedule reuse

14 years 4 months ago
Runtime compilation techniques for data partitioning and communication schedule reuse
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed 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 o -processor data copies with on-processor bu er locations. We present performance results for these mechanisms from a Fortran 90D compiler implementation.
Ravi Ponnusamy, Joel H. Saltz, Alok N. Choudhary
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1993
Where SC
Authors Ravi Ponnusamy, Joel H. Saltz, Alok N. Choudhary
Comments (0)