论文信息 - Strength Reduction via SSAPRE

Strength Reduction via SSAPRE

We present techniques that allow strength reduction to be performed concurrently with partial redundancy elimination in the SSAPRE framework. By sharing the characteristics inherent to SSAPRE, the resulting strength reduction algorithm exhibits many interesting attributes. We compare various aspects of the new strength reduction algorithm with previous strength reduction algorithms. We also outline and discuss our implementation of the closely related linear function test replacement optimization under the same framework.

[1] Bernhard Steffen,et al. Optimal code motion: theory and practice , 1994, TOPL.

[2] Mark N. Wegman,et al. Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.

[3] J. Knoop,et al. Lazy Strength Reduction , 1993 .

[4] Raymond Lo,et al. Loop induction variable canonicalization in parallelizing compilers , 1996, Proceedings of the 1996 Conference on Parallel Architectures and Compilation Technique.

[5] 李幼升,et al. Ph , 1989 .

[6] Dhananjay M. Dhamdhere. Corrigendum: a new algorithm for composite hoisting and strength reduction optimisation , 1989 .

[7] Etienne Morel,et al. Global optimization by suppression of partial redundancies , 1979, CACM.

[8] Bernhard Steffen,et al. Lazy code motion , 1992, PLDI '92.

[9] Dhananjay M. Dhamdhere. A new algorithm for composite hoisting and strength reduction optimisation , 1989 .

[10] Dhananjay M. Dhamdhere,et al. A composite hoisting-strength reduction transformation for global program optimization part ii , 1982 .

[11] Raymond Lo,et al. A new algorithm for partial redundancy elimination based on SSA form , 1997, PLDI '97.

[12] Ken Kennedy,et al. An algorithm for reduction of operator strength , 1977, Commun. ACM.

[13] Fred C. Chow,et al. A portable machine-independent global optimizer--design and measurements , 1984 .

[14] Robert Paige,et al. Look ma, no hashing, and no arrays neither , 1991, POPL '91.