Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA Form

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 17, Issue 1, 1995, Pages 85-122

  Gerlek, Michael P ^a   Stoltz, Eric ^a   Wolfe, Michael ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

Constant propagation; def use chain; demand driven; induction variable; static single assignment; strength reduction; wraparound variable

Indexed keywords

CONSTANT PROPAGATION; DEF USE CHAIN; DEMAND DRIVEN; INDUCTION VARIABLES; STATIC SINGLE ASSIGNMENT; STRENGTH REDUCTION; WRAP AROUND VARIABLE;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; PROGRAM COMPILERS; PROGRAMMING THEORY;

DATA STRUCTURES;

EID: 0029214850     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/200994.201003     Document Type: Article

References (24)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass.
2. ALLEN, F., BURKE, M., CHARLES, P., CYTRON, R., AND FERRANTE, J. 1988. An overview of the PTRAN analysis system for multiprocessing. J. Parallel Distrib. Comput. 5, 5 (Oct.), 617-640.
3. ALLEN, F. E., COCKE, J., AND KENNEDY, K. 1981. Reduction in operator strength. In Program Flow Analysis, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, N.J., 79-101.
4. AMMARGUELLAT, Z. AND HARRISON, W. L., III. 1990. Automatic recognition of induction variables and recurrence relations by abstract interpretation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, 283-295.
5. BALLANCE, R. A., MACCABE, A. B., AND OTTENSTEIN, K. J. 1990. The Program Dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, 257-271.
6. CYBENKO, G., KIPP, L., POINTER, L., AND KUCK, D. 1990. Supercomputer performance evaluation and the Perfect Benchmarks. In Proceedings of the International Conference on Supercomputing. ACM Press, New York, 254-266.
7. 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. Program. Lang. Syst. 13, 4 (Oct.), 451-490.
8. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1989. An efficient method of computing Static Single Assignment form. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, 25-35.
9. EIGENMANN, R., HOEFLINGER, J., LI, Z., AND PADUA, D. 1992. Experience in the automatic parallelization of four Perfect-Benchmark programs. In Workshop on Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, Eds. Lecture Notes in Computer Science, vol. 589. Springer-Verlag, New York, 65-83.
10. FERRANTE, J. AND OTTENSTEIN, K. J. 1983. A program form based on data dependency in predicate regions. In Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, 217-236.
11. GUPTA, R. AND SPEZIALETTI, M. 1991. Loop monotonic computations: An approach for the efficient run-time detection of races. In Proceedings of the SIGSOFT Symposium on Testing, Analysis, and Verification. ACM Press, New York, 98-111.
12. HAGHIGHAT, M. R. 1990. Symbolic dependence analysis for high performance parallelizing compilers. Tech. Rep. 995 (May), M.S. thesis, Univ. of Illinois (CSRD), Urbana, Ill.
13. HAGHIGHAT, M. R. AND POLYCHRONOPOULOS, C. D. 1992. Symbolic program analysis and optimization for parallelizing compilers. In Workshop on Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, Eds. Lecture Notes in Computer Science, vol. 589. Springer-Verlag, New York, 65-83.
14. HAVLAK, P. 1993. Construction of thinned gated single-assignment form. In Workshop on Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, Eds. Springer-Verlag, New York, 477-499. Lecture Notes in Computer Science, vol. 768.
15. KENNEDY, K. 1981. A survey of data flow analysis techniques. In Program Flow Analysis, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, N.J., 5-54.
16. LOVEMAN, D. B. AND FANEUF, R. A. 1975. Program optimization - Theory and practice. In Proceedings of a Conference on Programming Languages and Compilers for Parallel and Vector Machines. ACM Press, New York, 97-102.
17. PADUA, D. A AND WOLFE, M. 1986. Advanced compiler optimizations for supercomputers. Commun. ACM 29, 12 (Dec.), 1184-1201.
18. SHEN, Z., LI, Z, AND YEW, P -C. 1990. An empirical study of Fortran programs for parallelizing compilers. IEEE Trans. Parallel Distnb. Syst. 1, 3 (July), 356-364.
19. STOLTZ, E., GERLEK, M. P., AND WOLFE, M. 1994a. Extended SSA with factored use-def chains to support optimization and parallelism. In Hawaii International Conferences on System Sciences. IEEE, Los Alamitos, Calif.
20. STOLTZ, E., WOLFE, M., AND GERLEK, M. P. 1994b. Constant propagation: A fresh, demand-driven look. In Proceedings of the Symposium on Applied Computing. ACM Press, New York, 400-404.
21. TARJAN, R 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2 (June), 146-160.
22. Tu, P AND PADUA, D. 1993. Automatic array privatization. In Workshop on Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, Eds. Lecture Notes in Computer Science, vol 768. Springer-Verlag, New York, 500-521.
23. WOLFE, M. 1992. Beyond induction variables. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, 162-174.
24. WOLFE, M AND BANERJEE, U. 1987. Data dependence and its applications to parallel processing. Int. J. Parallel Program. 16, 2 (Apr.), 137-178.