Index Array Flattening Through Program Transformation

This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformation allows prefetching of array indices for more efficient structuring of communication on distributed-memory machines. It can also improve performance on other architectures by enabling prefetching of data between levels of the memory hierarchy or exploitation of hardware support for vectorized gather/scatter. Our techniques are implemented in a compiler for Fortran D and execution speed improvements are given for multiprocessor and vector machines.

• Type: Conference
• Year: 1995
• Where: SC
• Authors: Raja Das, Paul Havlak, Joel H. Saltz, Ken Kennedy
• Keywords: Applied Computing, Array References, Indirect Array, Paper Presents Techniques, SC 1995