Array Operation Synthesis to Optimize HPF Programs on Distributed Memory Machines

✍ Scribed by Gwan-Hwan Hwang; Jenq Kuen Lee; Roy Dz-Ching Ju

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 435 KB
• Volume: 61
• Category: Article
• ISSN: 0743-7315
• DOI: 10.1006/jpdc.2000.1680

✦ Synopsis

An increasing number of programming languages, such as Fortran 90, HPF, and APL, provide a rich set of intrinsic array functions and array expressions. These constructs, which constitute an important part of data parallel languages, provide excellent opportunities for compiler optimizations. The synthesis of consecutive array operations or array expressions into a composite access function of the source arrays at compile time has been shown (A. T. Budd, ACM Trans. Programm. Lang. Syst. 6 (July 1984), 297 313; G. H. Hwang et al., in ``Proc. of ACM SIGPLAN Conference on Principles and Practice of Parallel Programming , 1995,'' pp. 112 122) to be an effective scheme for optimizing programs on flat shared memory parallel architectures. It remains, however, to be studied how the synthesis scheme can be incorporated into optimizing HPF-like programs on distributed memory machines by taking into account communication costs. In this