Partial redundancy elimination in SSA form

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 3, 1999, Pages 627-676

  Kennedy, Robert ^b   Chan, Sun ^a   Liu, Shin Ming ^a   Lo, Raymond ^a   Tu, Peng ^b   Chow, Fred ^a  

^a HEWLETT PACKARD ENTERPRISE   (United States)

^b NONE   (United States)

Author keywords

Code motion; Common subexpressions; Data flow analysis; Partial redundancy; Static single assignment form

Indexed keywords

CODE MOTION; PARTIAL REDUNDANCY;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER CONTROL; DATA FLOW ANALYSIS; DATA REDUCTION; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROBLEM SOLVING; REDUNDANCY; STATISTICAL METHODS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0012575181     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/319301.319348     Document Type: Article

References (37)

1. ALPERN, B., WEGMAN, M. N., AND ZADECK, F. K. 1988. Detecting equality of values in programs. In Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages. 1-11.
2. BRIGGS, P. AND COOPER, K. 1994. Effective partial redundancy elimination. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. 159-170.
3. BRIGGS, P., COOPER, K. D., AND SIMPSON, L. T. 1997. Value numbering. Software Practice and Experience 27, 6 (June), 701-724.
4. CHOI, J., CYTRON, R., AND FERRANTE, J. 1991. Automatic construction of sparse data flow evaluation graphs. In Conference Record of the Eighteenth ACM Symposium on Principles of Programming Languages. 55-66.
5. CHOI, J., SARKAR, V., AND SCHONBERG, E. 1996. Incremental computation of static single assignment form. In Proceedings of the Sixth International Conference on Compiler Construction. 223-237.
6. CHOW, F. 1983. A portable machine-independent global optimizer - design and measurements. Tech. Rep. 83-254 (PhD Thesis), Computer Systems Laboratory, Stanford University. Dec.
7. CHOW, F. 1988. Minimizing register usage penalty at procedure calls. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation. 85-94.
8. CHOW, F., CHAN, S., KENNEDY, R., LIU, S., LO, R., AND TU, P. 1997. A new algorithm for partial redundancy elimination based on SSA form. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. 273-286.
9. CHOW, F., CHAN, S., LIU, S., LO, R., AND STREICH, M. 1996. Effective representation of aliases and indirect memory operations in SSA form. In Proceedings of the Sixth International Conference on Compiler Construction. 253-267.
10. CHOW, F., HIMELSTEIN, M., KILLIAN, E., AND WEBER, L. 1986. Engineering a RISC compiler. In Proceedings of IEEE COMPCON. 132-137.
11. CLICK, C. 1995. Global code motion global value numbering. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation. 246-257.
12. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems 13, 4 (Oct.), 451-490.
13. DHAMDHERE, D. 1988. A fast algorithm for code movement optimisation. SIGPLAN Notices 23, 1, 172-180.
14. DHAMDHERE, D. 1989. A new algorithm for composite hoisting and strength reduction optimization Journal of Computer Mathematics 27, 1-14 (+ 31-32).
15. DHAMDHERE, D., ROSEN, B., AND ZADECK, K. 1992. How to analyze large programs efficiently and informatively. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation. 212-223.
16. DHANESHWAR, V. M. AND DHAMDHERE, D. M. 1995. Strength reduction of large expressions. Journal of Programming Languages 3, 95-120.
17. DRECHSLER, K. AND STADEL, M. 1988. A solution to a problem with morel and renvoise's "global optimization by suppression of partial redundancies". ACM Trans. on Programming Languages and Systems 10, 4 (Oct.), 635-640.
18. DRECHSLER, K. AND STADEL, M. 1993. A variation of Knoop, Rüthing and Steffen's lazy code motion. SIGPLAN Notices 28, 5 (May), 29-38.
19. GERLEK, M., STOLTZ, E., AND WOLFE, M. 1995. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Trans. on Programming Languages and Systems 17, 1 (Jan.), 85-122.
20. GERLEK, M., WOLFE, M., AND STOLTZ, E. 1994. A reference chain approach for live variables. Tech. Rep. CSE 94-029, Oregon Graduate Institute. Apr.
21. JOHNSON, R., PEARSON, D., AND PINGALI, K. 1994. The program structure tree: Computing control regions in linear time. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. 171-185.
22. JOSHI, S. M. AND DHAMDHERE, D. M. 1982. A composite hoisting-strength reduction transformation for global program optimization. International Journal of Computer Mathematics Parts I & II 11, 1 and 2, 21-41 and 111-126.
23. KENNEDY, K. 1972. Safety of code motion. International Journal of Computer Mathematics 3, 2 and 3, 117-130.
24. KENNEDY, R., CHOW, F., DAHL, P., LIU, S., LO, R., AND STREICH, M. 1998. Strength reduction via SSAPRE. In Proceedings of the Seventh International Conference on Compiler Construction.
25. KNOOP, J., RÜTHING, O., AND STEFFEN, B. 1992. Lazy code motion. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation. 224-234.
26. KNOOP, J., RUdie;THING, O., AND STEFFEN, B. 1993. Lazy strength reduction. Journal of Programming Languages 1, 1 (Mar.), 71-91.
27. KNOOP, J., RÜTHING, O., AND STEFFEN, B. 1994. Optimal code motion: Theory and practice. ACM Trans. on Programming Languages and Systems 16, 4 (Oct.), 1117-1155.
28. LIU, S., LO, R., AND CHOW, F. 1996. Loop induction variable canonicalization in parallelizing compilers. In Proceedings of the Fourth International Conference on Parallel Architectures and Compilation Techniques. 228-237.
29. LO, R., CHOW, F., KENNEDY, R., LIU, S., AND TU, P. 1998. Register promotion by sparse partial redundancy elimination of loads and stores. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation.
30. MOREL, E. AND RENVOISE, C. 1979. Global optimization by suppression of partial redundancies. Comm. ACM 22, 2 (Feb.), 96-103.
31. MUCHNICK, S. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, San Francisco.
32. ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1988. Global value numbers and redundant computations. In Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages. 12-27.
33. SCHWARZ B., KIRCHGÄSSNER, W., AND LANDWEHR, R. 1988. An optimizer for Ada - Design, experiences and results. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation. 175-184.
34. SIMPSON, L. T. 1996. Value-driven redundancy elimination. Tech. Rep. (PhD Thesis), Dept. of Computer Science, Rice University. Apr.
35. SREEDHAR, V. AND GAO, G. 1995. A linear time algorithm for placing φ-nodes. In Conference Record of the Twenty Second ACM Symposium on Principles of Programming Languages. 62-73.
36. WEGMAN, M. AND ZADECK, K. 1991. Constant propagation with conditional branches. ACM Trans. on Programming Languages and Systems 13, 2 (Apr.), 181-210.
37. WOLFE, M. 1996. High Performance Compilers For Parallel Computing. Addison Wesley.