On Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines

Authors:
S. K. S. Gupta;S. D. Kaushik;S. Mufti;S. Sharma;C.-H. Huang;P. Sadayappan
Affiliations:
Ohio State University Columbus;Ohio State University Columbus;Ohio State University Columbus;Ohio State University Columbus;Ohio State University Columbus;Ohio State University Columbus
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Year:
1993

Citing 0
Cited 2

Exploiting Ownership Sets in HPF

LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
An Expression-Rewriting Framework to Generate Communication Sets for HPF Programs with Block-Cyclic Distribution

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient generation of communication sets and local index sets is important for evaluation of array expressions in scientific languages such as Fortran-90 and High Performance Fortran implemented on distributed-memory machines. We show that for arrays affinely aligned with templates that are distributed on multiple processors with a block-cyclic distribution, the local memory access sequence and communication sets can be efficiently enumerated using closed forms. First, closed form solutions are presented for arrays that are aligned with identity template that are distributed using block or cyclic distributions.