Optimal Control Dependence Computation and the Roman Chariots Problem

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 3, 1997, Pages 462-491

  Pingali, Keshav ^b   Bilardi, Gianfranco ^a,c,d  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c UNIVERSITY OF PADOVA   (Italy)

^d 1120 Science and Engineering Offices   (United States)

Author keywords

Algorithms; Compilers; Control dependence; D.3.4 Programming Languages : Processors compilers and optimization; I.1.2 Algebraic Manipulation : Algorithms analysis of algorithms; Languages; Program optimization; Program transformation; Theory

Indexed keywords

DATA STRUCTURES; OPTIMIZATION; PARALLEL ALGORITHMS; PROGRAM COMPILERS; SET THEORY; STRUCTURED PROGRAMMING; TREES (MATHEMATICS);

AUGMENTED POSTDOMINATOR TREE (APT); CONTROL DEPENDENCE GRAPH (CDG);

PROGRAMMING THEORY;

EID: 0031147607     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/256167.256217     Document Type: Article

References (24)

1. AHO, A. V., HOPCROFT, J., AND ULLMAN, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. ALLEN, F., BURKE, M., CYTRON, R., FERRANTE, J., HSIEH, W., AND SARKAR, V. 1988. A framework for determining useful parallelism. In Proceedings of the 1988 International Conference on Supercomputing. IEEE, New York, 207-215.
3. BALL, T. 1993. What's in a region? or computing control dependence regions in near-linear time for reducible control flow. ACM Lett. Program. Lang. Syst. 2, 1-4 (Mar.-Dec.), 1-16.
4. BERNSTEIN, D. AND RODEH, M. 1991. Global instruction scheduling for superscalar machines. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation. ACM, New York, 241-255.
5. BILARDI, G. AND PINGALI, K. 1996. A framework for generalized control dependence. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implementation. ACM, New York, 291-300.
6. CHAZELLE, B. 1986. Filtering search: A new approach to query answering. SIAM J. Comput. 15, 703-724.
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., AND SARKAR, V. 1990. Compact representations for control dependence. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation. ACM, New York, 337-351.
9. FERRANTE, J., OTTENSTEIN, K. J., AND WARREN, J. D. 1987. The program dependency graph and its uses in optimization. ACM Trans. Program. Lang. Syst. 9, 3 (June), 319-349.
10. FISHER, J. 1981. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Comput. 7, 3, 478-490.
11. GUPTA, R., POLLOCK, L., AND SOFFA, M. L. 1990. Parallelizing data flow analysis. In Proceedings of the Workshop on Parallel Compilation. Queen's University, Kingston, Ontario.
12. GUPTA, R. AND SOFFA, M. L. 1987. Region scheduling. In 2nd International Conference on Supercomputing. IEEE, New York, 141-148.
13. HAREL, D. 1985. A linear time algorithm for finding dominators in flowgraphs and related problems. In Proceedings of the 17th ACM Symposium on Theory of Computing. ACM, New York, 185-194.
14. HOROWITZ, S., PRINS, J., AND REPS, T. 1987. Integrating non-interfering versions of programs. In Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 133-145.
15. JOHNSON, R. 1994. Efficient program analysis using dependence flow graphs. Ph.D. thesis, Cornell Univ., Ithaca, N.Y.
16. JOHNSON, R. AND PINGALI, K. 1993. Dependence-based program analysis. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation. ACM, New York, 78-89.
17. JOHNSON, R., PEARSON, D., AND PINGALI, K. 1994. The program structure tree: Computing control regions in linear time. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation. ACM, New York, 171-185.
18. LENGAUER, T. AND TARJAN, R. E. 1979. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 1 (July), 121-141.
19. MICHIE, D. 1968. Memo functions and machine learning. Nature 218, 19-22.
20. NEWBURN, C., NOONBURG, D., AND SHEN, J. 1994. A PDG-based tool and its use in analyzing program control dependences. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. IEEE, New York.
21. PINGALI, K. AND BILARDI, G. 1995. APT: A data structure for optimal control dependence computation. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation. ACM, New York, 32-46.
22. SEGRE, A. AND SCHARSTEIN, D. 1993. Bounded-overhead caching for definite-clause theorem proving. J. Autom. Reason. 11, 83-113.
23. SIMONS, B., ALPERN, D., AND FERRANTE. J. 1990. A foundation for sequentializing parallel code. In SPAA '90: ACM Symposium on Parallel Algorithms and Architecture. ACM, New York.
24. SREEDHAR, V. C., GAO, G. R., AND LEE, Y. 1994. DJ-graphs and their applications to flowgraph analyses. Tech. Rep. ACAPS Memo 70, McGill Univ., Montreal, Canada. May.