Publisher's Synopsis
This paper describes two new ideas by which an 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 use of program arrays to describe graph connectivity, spatial location of array elements, and computational load. The second mechanism is a simple conservative method that in many cases enables a compiler to recognize that it is possible to reuse previously computed information from inspectors (e.g. communication schedules, loop iteration partitions, information that associates off-processor data copies with on-processor buffer locations). We present performance results for these mechanisms from a Fortran 90D compiler implementation. Ponnusamy, Ravi and Saltz, Joel and Choudhury, Alok and Hwang, Yuan-Shin and Fox, Geoffrey Unspecified Center NAS1-19480; ONR-SC-292-1-22913; NSF ASC-92-13821; NSF CCR-93-57840; NAG1-1485; RTOP 505-90-52-01
