Gated SSA-based demand-driven symbolic analysis for parallelizing compilers

Proceedings of the International Conference on Supercomputing

Volumn Part F129361, Issue , 1995, Pages 414-423

  Tu, Peng ^a   Padua, David ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW GRAPHS; PRIVATIZATION; DATA REDUCTION; HEURISTIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS;

DEMAND-DRIVEN; INDEX ARRAYS; LOOP PARALLELIZATION; ON DEMANDS; PARALLELIZING COMPILER; PROGRAM FLOW; SUBSTITUTION SCHEME; SYMBOLIC ANALYSIS;

INTELLIGENT CONTROL; PROGRAM COMPILERS;

ARRAY PRIVATIZATION; BACKWARD SUBSTITUTION METHOD; INDEX ARRAYS; LOOP PARALLELIZATION; PARALLELIZING COMPILERS; SYMBOLIC ANALYSIS;

EID: 0029190370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/224538.224648     Document Type: Conference Paper

References (25)

1. F. Allen, M. Burke, R. Cytron, and J. Ferrante. An overview of the ptran analysis system for multiprocessing. Journal of Parallel and Distributed Computing, (5):617-640, October 1988.
2. Z. Ammarguellat and W. L. Harrison. Automatic recognition of induction variables and recurrence relations by abstract interpretation. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 283-295. ACM Press, 1990.
3. A. V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
4. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In Proc. of the 15th ACM Symposium on Principles of Programming Languages, pages 1-11, 1988.
5. William Blume and Rudolf Eigenmann. The range test: A dependence test for symbolic, non-linear expressions. In Proceedings of Super-computing '94, November 1994.
6. William Blume and Rudolf Eigenmann. Symbolic analysis techniques needed for the effective parallelization of the perfect benchmarks. Technical Report 1332, Univ. of Illinois at Urbana-Champaign, Cntr. for Supercomputing Res. k. Dev., January 1994.
7. Bill Blume, Rudolf Eigenmann, Keith Faigin, John Grout, Jay Hoeflinger, David Padua, Paul Petersen, Bill Pottenger, Lawrence Rauchwerger, Peng Tu, and Stephen Weatherford. Polaris: The next generation in parallelizing compilers. In Proc. 7th Workshop on Programming Languages and Compilers for Parallel Computing, August 1994.
8. R. Ballance, A. Maccabe, and K. Ottenstein. The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proceedings of the SIGPLAN'90 Conference on Programming Language Design and Implementation, pages 257-271, June 1990.
9. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. A CM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
10. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th Annual ACM Symposium on Principles of Programming Languages, pages 84-97, January 1978.
11. P. Cousot and N. Halbwachs. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
12. T. E. Cheatham, G. H. Holloway, and J. A. Townley. Symbolic evaluation and the analysis of programs. IEEE Transactions on Software Engineering, 5(4):402-417, 1979.
13. George Cybenko, Lyle Kipp, Lynn Pointer, and David Kuck. Supercomputer performance evaluation and the perfect benchmarks. In Proceedings of ICS, Amsterdam, Netherlands, pages 162-174, March 1990.
14. L. A. Clarke and D. J. Richardson. Applications of symbolic evaluation. Journal of Systems and Software, 5(1):15-35, 1985.
15. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependency graph and its uses in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319-349, June 1987.
16. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of the NP-Completeness. Freeman, 1979.
17. M. P. Gerlek, E. Stoltz, and M. Wolfe. Beyond induction variables: Detecting and classifying sequences using a demand-driven ssa form, to appear on, ACM TPLAS.
18. Paul Havlak. Construction of thinned gated single-assignment form. In Proc. 6rd Workshop on Programming Languages and Compilers for Parallel Computing, August 1993.
19. M. R. Haghighat and C. D. Polychronopoulos. Symbolic program analysis and optimization for parallelizing compilers. In Proc. 5rd Workshop on Programming Languages and Compilers for Parallel Computing, August 1992.
20. K. Kennedy. A survey of data flow analysis techniques. In S. Muchnick and N. Jones, editors, Program Flow Analysis. Prentice-H all, 1981.
21. J. H. Morris and B. Wegbreit. Subgoal induction. Communication of ACM, 20(4):209-222, 1977.
22. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computation. In Proc. of the 15th ACM Symposium on Principles of Programming Languages, pages 12-27, 1988.
23. Peng Tu and David Padua. Automatic array privatization. In Proc. 6rd Workshop on Programming Languages and Compilers for Parallel Computing, August 1993.
24. Peng Tu and David Padua. Efficient building and placing of gating functions. In Proc. of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, June 1995.
25. Michael Wolfe. Beyond induction variables. Proc. the SIGPLAN'92 Conference on Programming Language Design and Implementation, June 1992.