The Program Dependence Graph and Its Use in Optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 9, Issue 3, 1987, Pages 319-349

  Ferrante, Jeanne ^a   Ottenstein, Karl J ^b   Warren, Joe D ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Michigan Technological University   (United Kingdom)

^c RICE UNIVERSITY   (United States)

Author keywords

branch deletion; code motion; Data flow; debugging; dependence analysis; incremental data flow analysis; intermediate program representation; internal program form; loop fusion; loop unrolling; node splitting; parallelism; slicing; vectorization

Indexed keywords

COMPUTER METATHEORY; COMPUTER SYSTEMS PROGRAMMING - THEORY; DATA PROCESSING - DATA STRUCTURES; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

COMPILER OPTIMIZATION; CONTROL FLOW GRAPH; INCREMENTAL DATA FLOW ANALYSIS; INTERMEDIATE PROGRAM REPRESENTATION; PROGRAM DEPENDENCE GRAPH (PDG);

COMPUTER OPERATING SYSTEMS;

EID: 0023385308     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/24039.24041     Document Type: Article

References (56)

1. Aho, A. V., Sethi, R., and Ullman, J. D. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986. [An alternative reference is this book's predecessor, Aho, A. V. and Ullman, J. D. Principles of Compiler Design. Addison-Wesley, 1977.]
2. Alberga, C. N., Brown, A. L., Leeman, G. B., Jr., Mikelsons, M., and Wegman, M. N. A program development tool. IBM J. Res. Dev 28,1 (Jan. 1984).
3. Allen, F. E. Control flow analysis. In Proceedings of a Symposium on Compiler Optimization. SIGPLAN Not. 5, 7 (July 1970), 1-19.
4. Allen, F. E. Interprocedural analysis and the information derived by it. In Lecture Notes in Computer Science Vol. 23, Springer-Verlag, New York, 1974, 291-321.
5. Allen, F. E., and Cocke, J. A catalogue of optimizing transformations. In Design and Optimization of Compilers, Randall Rustin, Ed., Prentice-Hall, Englewood Cliffs, NJ, 1972,1-30.
6. Allen, F. E., Cocke, J., and Kennedy, K. Reduction of operator strength. In Program Flow Analysis, Theory and Applications, S. Muchnick and N. Jones, Eds., Prentice-Hall, Englewood Cliffs, NJ, 1981, 79-101.
7. Allen, J. R. Dependence analysis for subscripted variables and its application to program transformations. Ph.D. dissertation, Dept. of Computer Science, Rice University, Houston, TX, April 1983.
8. Allen, J. R., Kennedy, K., Porterfield, C., and Warren, J. Conversion of control dependence to data dependence. In Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages (Austin, Texas, Jan. 24-26, 1983), ACM, New York, 177-189.
9. Allen, J. R., and Kennedy, K. PFC: a program to convert FORTRAN to parallel form. Tech. Rep. 82-6, Dept. of Mathematical Sciences, Rice University, March 1982, 63 pages.
10. Allen, R., and Kennedy, K. Programming environments for supercomputers. In Supercomputers: Algorithms, Architectures, and Scientific Computation, F. A. Matsen and T. Tajima, Eds., University of Texas Press, Austin, TX, 1986,19-38.
11. Banerjee, U. Data dependence in ordinary programs. Report 76-837, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Nov. 1976.
12. Burke, M. An interval analysis approach toward interprocedural data flow analysis. IBM Research Report RC 10640, T. J. Watson Research Center, Yorktown Heights, NY, July 1984.
13. Burke, M., and Cytron, R. Interprocedural dependence analysis and parallelization. In Proceedings of the ACM SIGPLAN '86 Symposium on Compiler Construction (Palo Alto, CA, June 25-27,1986). ACM SIGPLAN Not. 21, 7 (July 1986), 162-175.
14. Cooper, K., and Kennedy, K. Efficient computation of flow insensitive summary information. In Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction (Montreal, June 17-22,1984). ACM SIGPLAN Not. 19, 6 (June 1984), 247-258.
15. Cooper, K. Analyzing aliases of reference formal parameters. In Conference Record of the 12th ACM Symposium on Principles of Programming Languages (New Orleans, LA, Jan. 14-16,1985), ACM, New York, 281-290.
16. Cytron, R., Lowry, A., and Zadeck, K. Code motion of control structures in high-level languages. In Conference Record 13th Annual ACM Symposium on Principles of Programming Languages (St. Petersburg, FL, Jan. 13-15,1986), ACM, New York, 70-85.
17. David, A. L., and Keller, R. M. Data flow program graphs. IEEE Comput. 15, 2 (Feb. 1982), 26-41.
18. Dennis, J. B. First version of a data flow procedure language, revised Comp. Struc. Group Memo 93 (MAC Tech. Memo 61) MIT LCS (May 1975) 21 pages.
19. Dennis, J. B. Data flow supercomputers. IEEE Comput. 13,11 (Nov. 1980), 48-56.
20. Ellcey, S. J. The program dependence graph: interprocedural information representation and general space requirements. Master's thesis, Dept. of Computer Science, Michigan Technological Univ., Houghton, MI, Aug. 1985.
21. Ferrante, J. The program dependence graph as a basis for node splitting transformations. IBM Research Rep. RC 10542, Yorktown Heights, NY, June 1984.
22. Ferrante, J., AND Mace, M. On linearizing parallel code. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages (New Orleans, LA, Jan. 14-16, 1985), ACM, New York, 179-190.
23. Ferrante, J., and Ottenstein, K. A program form based on data dependency in predicate regions. In Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages (Austin, TX, Jan. 24-26, 1983), ACM, New York, 217-231.
24. Ferrante, J., Ottenstein, K., and Warren, J. D. The program dependence graph and its use in optimization. Lecture Notes in Computer Science Vol. 167, Springer-Verlag, 1984, 125-132.
25. Graham, S., and Wegman, M. A fast and usually linear algorithm for global flow analysis. J. ACM 23, 1 (Jan. 1976), 172-202.
26. Hecht, M. S. Flow Analysis of Computer Programs. Elsevier-North Holland, New York, 1977.
27. Kas'janov, V. N. Distinguishing hammocks in a directed graph. Soviet Math. Doklady 16, 5 (1975), 448-450.
28. Kennedy, K. Automatic translation of FORTRAN programs to vector form. Report 476-029-4, Dept. of Mathematical Sciences, Rice Univ., Houston, TX, June 1980.
29. Kuck, D. J. The Structure of Computers and Computations. Wiley, New York, 1978.
30. Kuck, D. J., Kuhn, R. H., Leasure, B., and Wolfe, M. The structure of an advanced vectorizer for pipelined processors. In Proceedings IEEE 4th International COMPSAC (Chicago, IL, Oct. 1980), IEEE, New York, 709-715.
31. Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., and Wolfe, M. Dependence graphs and compiler optimizations. In 8th Annual ACM Symposium on Principles of Programming Languages (Williamsburg, VA, Jan. 26-28,1981), ACM, New York, 207-218.
32. Kuhn, R. H. Optimization and interconnection complexity for parallel processors, single-stage networks and decision trees. Ph.D. dissertation, Rep. 80-1009, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Feb. 1980.
33. Lengauer, T., and Tarjan, R. E. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 1 (July 1979), 121-141.
34. McGraw, J., Skedzielewski, S., Allan, S., Grit, D., Oldehoeft, R., Glauert, J., Dobes, I., and Hohensee, P. SISAL: streams and iteration in a single-assignment language. Language reference manual version 1.1. Report M-146, Lawrence Livermore National Laboratory, July 20, 1983.
35. Mikelsons, M. Prettyprinting in an interactive environment. In Proceedings of the ACM SIGPLAN/SIGOA Symposium on Text Manipulation (Portland, OR, June 1981), ACM, New York, 108-116.
36. Ottenstein, K. J. Data-flow graphs as an intermediate program form. Ph.D. dissertation, Computer Sciences Dept., Purdue University, Lafayette, IN, Aug. 1978.
37. Ottenstein, K. J. An intermediate program form based on a cyclic data-dependence graph. CS-TR 81-1, Dept. of Computer Science, Michigan Technological Univ., Houghton, MI, Oct. 1981; July 1982, errata.
38. Ottenstein, K. J., and Ottenstein, L. M. The program dependence graph in a software development environment. In Proceedings of the ACM SIGPLAN/SIGSOFT Symposium on Practical Programming Development Environments (Pittsburgh, PA, April 23-25, 1984), ACM SIGPLAN Not. 19, 5 (May 1984), 177-184, and Softw. Eng. Notes 9, 3.
39. Ottenstein, K. J. A simplified view of reduction in strength. CS-TR 85-4c, Michigan Technological Univ., Houghton, MI, Aug. 1986.
40. Padua, D. A. Multiprocessors: discussion of some theoretical and practical problems. Ph.D. dissertation, Computer Sciences Dept., Univ. of Illinois, Urbana-Champaign, Sept. 1979.
41. Padua, D. A., Kuck, D. J., and Lawrie, D. High-speed multiprocessors and their compilers. IEEE Trans. Comput. 29, 9 (Sept. 1980), 763-776.
42. Reif, J. H., and Lewis, H. R. Symbolic evaluation and the global value graph. In Conference Record of the 4th Annual ACM Symposium on Principles of Programming Languages (Los Angeles, CA, Jan. 17-19, 1977), ACM, New York, 104-118.
43. Ryder, B. G. Incremental data flow analysis. In Conference Record 10th Annual ACM Symposium on Principles of Programming Languages (Austin, TX, Jan. 1983), ACM, New York, 167-176.
44. Sarkar, V., and Hennessy, J. Compile-time partitioning and scheduling of parallel programs. In Proceedings of the ACM SIGPLAN Compiler Construction Conference (Palo Alto, CA, June 25-27,1986), ACM SIGPLAN Not. 21, 7 (July 1986).
45. Sarkar, V., and Hennessy, J. Partitioning parallel programs for macro-dataflow. In Proceedings of the ACM Conference on LISP and Functional Programming (Cambridge, UK, Aug. 4-6, 1986), ACM, New York, 202-211.
46. Skedzielewski, S., and Glauert, J. IF1: an intermediate form for applicative langauges, draft 4. Lawrence Livermore National Laboratory, Livermore, CA, June 26, 1983.
47. Tischler, R., Schaufler, R., and Payne, C. Static analysis of programs as an aid to debugging. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on High-Level Debugging (Pacific Grove, CA, March 20-23, 1983), ACM Softw. Eng. Notes 8, 4 (Aug. 1983) and in ACM SIGPLAN Not. 18, 8 (Aug. 1983), 155-158.
48. Towle, R. A. Control and data dependence for program transformations. Ph.D. dissertation, Univ. of Illinois, Urbana-Champaign, Feb. 1976.
49. Treleaven, P. C., Hopkins, R. P., and Rautenbach, P. W. Combining data flow and control flow computing. Comput. J. 25, 2 (1982), 208-217.
50. Warren, J. A hierarchical basis for reordering transformations. In Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages (Salt Lake City, UT, Jan. 1984), ACM, New York, 272-282.
51. Waters, R. C. The programmer's apprentice: knowledge based program editing. IEEE Trans. Softw. Eng. SE-8, 1 (Jan. 1982), 1-12.
52. Waters, R. C. Automatic analysis of the logical structure of programs. AI-Lab TR-492, MIT, Cambridge, MA., Dec. 1978. Available as NTIS AD-A084 818.
53. Wegman, M. Summarizing graphs by regular expressions. In Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages (Austin, TX, Jan. 24-26, 1983), ACM, New York, 203-212.
54. Weiser, M. Program slicing. In Proceedings of the 5th International Conference on Software Engineering (San Diego, CA, March 9-12, 1981), IEEE Computer Society Press, New York, 439-449.
55. Weiser, M. Programmers use slices when debugging. Commun. ACM 25, 7 (July 1982), 446-452.
56. Wolfe, M. J. Optimizing supercompilers for supercomputers. Ph.D. dissertation. Tech. Rep. UIUCDCS-R-82-1105, Univ. of Illinois, Urbana-Champaign, Oct. 1982.