On compiling array expressions for Efficient execution on distributed-memory machines

S. K.S. Gupta, S. D. Kaushik, S. Mufti, S. Sharma, C. H. Huang, P. Sadayappan

Research output: Contribution to journalConference articlepeer-review

30 Scopus citations


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 templates that are distributed using block or cyclic distributions. These closed forms are then used with a uirtual processor approach to give an efficient solution for arrays with block-cyclic distributions. These results are extended to arrays affinely aligned to arbitrary templates that have regular distributions. We present performance results on an iPSC/860 processor, that demonstrate the low runtime overhead of this scheme.

Original languageEnglish (US)
Article number4134228
Pages (from-to)301-305
Number of pages5
JournalProceedings of the International Conference on Parallel Processing
StatePublished - Jan 1 1993
Externally publishedYes
Event1993 International Conference on Parallel Processing, ICPP 1993 - Syracuse, United States
Duration: Aug 16 1993Aug 20 1993

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture


Dive into the research topics of 'On compiling array expressions for Efficient execution on distributed-memory machines'. Together they form a unique fingerprint.

Cite this