Runtime array redistribution in HPF programs

Rajeev Thakur*, Alok Choudhary, Geoffrey Fox

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

43 Scopus citations


This paper describes efficient algorithms for run-time array redistribution in HPF programs. We consider block(m) to cyclic, cyclic to block(m) and the general cyclic(x) to cyclic(y) type redistributions. We initially describe algorithms for one-dimensional arrays and then extend the methodology to multidimensional arrays. The algorithms are practical enough to be easily implemented in the runtime library of an HPF compiler and can also be directly used in application programs requiring redistribution. Performance results on the Intel Paragon are discussed.

Original languageEnglish (US)
Title of host publicationProceedings of the Scalable High-Performance Computing Conference
Number of pages8
StatePublished - Dec 1 1994
EventProceedings of the Scalable High-Performance Computing Conference - Knoxville, TN, USA
Duration: May 23 1994May 25 1994


OtherProceedings of the Scalable High-Performance Computing Conference
CityKnoxville, TN, USA

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Runtime array redistribution in HPF programs'. Together they form a unique fingerprint.

Cite this