Induction Variable Substitution And Reduction Recognition In The Polaris Parallelizing Compiler

The elimination of induction variables and the parallelization of reductions in FORTRAN codes is integral to performance improvement on shared-memory multi-processors ([11]). As part of the Polaris Project, compiler passes which do induction variable substitution and reduction recognition have been implemented and evaluated.

[1]  Utpal Banerjee,et al.  Dependence analysis for supercomputing , 1988, The Kluwer international series in engineering and computer science.

[2]  Rudolf Eigenmann,et al.  Symbolic range propagation , 1995, Proceedings of 9th International Parallel Processing Symposium.

[3]  Constantine D. Polychronopoulos,et al.  Symbolic Program Analysis and Optimization for Parallelizing Compilers , 1992, LCPC.

[4]  William Pugh,et al.  The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[5]  Anoop Gupta,et al.  Making effective use of shared-memory multiprocessors: the process control approach , 1991 .

[6]  Rudolf Eigenmann,et al.  The range test: a dependence test for symbolic, non-linear expressions , 1994, Proceedings of Supercomputing '94.

[7]  Constantine D. Polychronopoulos,et al.  Symbolic Analysis: A Basis for Parallelization, Optimization, and Scheduling of Programs , 1993, LCPC.

[8]  Peng Tu.  E cient Building and Placing of Gating Functions , 1995 .

[9]  David A. Padua,et al.  Experience in the Automatic Parallelization of Four Perfect-Benchmark Programs , 1991, LCPC.

[10]  Lawrence Rauchwerger,et al.  Automatic Detection of Parallelism: A grand challenge for high performance computing , 1994, IEEE Parallel & Distributed Technology: Systems & Applications.

[11]  Mark N. Wegman,et al.  An efficient method of computing static single assignment form , 1989, POPL '89.

[12]  Michael Wolfe,et al.  Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form , 1995, TOPL.