Loop distribution with multiple exits

The authors present a loop distribution algorithm that accommodates loops with multiple exits. The algorithm utilizes and appropriately transforms abstract representations of the program, rendering these structures suitable for further program transformations. Results from implementing this algorithm in the PTRAN system at IBM Research are presented.<<ETX>>

[1]  Vivek Sarkar,et al.  Compact representations for control dependence , 1990, PLDI '90.

[2]  Ken Kennedy,et al.  Automatic translation of FORTRAN programs to vector form , 1987, TOPL.

[3]  Ken Kennedy,et al.  Loop distribution with arbitrary control flow , 1990, Proceedings SUPERCOMPUTING '90.

[4]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1984, TOPL.

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  John Cocke,et al.  Programming languages and their compilers , 1969 .

[7]  Geoffrey C. Fox,et al.  The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers , 1989, Int. J. High Perform. Comput. Appl..

[8]  Wilson C. Hsieh,et al.  Automatic generation of DAG parallelism , 1989, PLDI '89.

[9]  Ken Kennedy,et al.  Conversion of control dependence to data dependence , 1983, POPL '83.

[10]  William Baxter,et al.  The program dependence graph and vectorization , 1989, POPL '89.

[11]  David A. Padua,et al.  Dependence graphs and compiler optimizations , 1981, POPL '81.

[12]  FerranteJeanne,et al.  The program dependence graph and its use in optimization , 1987 .

[13]  Vivek Sarkar.  PTRAN—the IBM parallel translation system , 1991 .

[14]  Ken Kennedy,et al.  Software methods for improvement of cache performance on supercomputer applications , 1989 .

[15]  John Cocke,et al.  Programming languages and their compilers: Preliminary notes , 1969 .

[16]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.