Interprocedural compilation of irregular applications for distributed memory machines

Gagan Agrawal, Joel Saltz

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations


Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the interprocedural optimizations required for compiling applications having irregular data access patterns, when coded in such data parallel languages. We have developed an Interprocedural Partial Redundancy Elimination (IPRE) algorithm for optimized placement of runtime preprocessing routine and collective communication routines inserted for managing communication in such codes. We also present two new interprocedural optimizations: placement of scatter routines and use of coalescing and incremental routines. We then describe how program slicing can be used for further applying IPRE in more complex scenarios. We have done a preliminary implementation of the schemes presented here using the Fortran D compilation system as the necessary infrastructure. We present experimental results from two codes compiled using our system to demonstrate the efficacy of the presented schemes.

Original languageEnglish (US)
Pages (from-to)1270-1316
Number of pages47
JournalProceedings of the ACM/IEEE Supercomputing Conference
StatePublished - 1995
EventProceedings of the 1995 ACM/IEEE Supercomputing Conference. Part 2 (of 2) - San Diego, CA, USA
Duration: Dec 3 1995Dec 8 1995

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Interprocedural compilation of irregular applications for distributed memory machines'. Together they form a unique fingerprint.

Cite this