APT: A data structure for optimal control dependence computation

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn Part F129371, Issue , 1995, Pages 32-46

  Pingali, Keshav ^a   Bilardi, Gianfranco ^b  

^a Department of Obstetrics Gynecology   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; DATA STRUCTURES; QUERY PROCESSING; STRUCTURAL OPTIMIZATION;

CONTROL-DEPENDENCE GRAPHS; DATAFLOW; DEPENDENCE RELATION; OPTIMAL CONTROLS; RESTRUCTURING COMPILERS; SPACE AND TIME;

TREES (MATHEMATICS);

EID: 33750637421     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/207110.207114     Document Type: Conference Paper

References (27)

1. [ABC. 88] Frances Allen, Michael Burke, Ron Cytron, Jeanne Ferrante, Wilson Hsieh, Vivek Sarkar. A framework for determining useful parallelism. In Proceedings of the 1988 International Conference on Supercomputing, pages 207-215, St. Malo, France, July 4-8, 1988.
2. [Bal93] Thomas Ball. What's in a region or computing control dependence regions in near-linear time for reducible control flow ACM Letters on Programming Languages and Systems, 2(1-4): 1-16, March-December 1993.
3. [BR91] David Bernstein and Michael Rodeh. Global instruc-tion scheduling for superscalar machines In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 241-255, Toronto, Ontario, June 26-28,1991.
4. [CF93] Ron Cytron and Jeanne Ferrante. Efficiently comput-ing-nodes on-the-fly. In Proceedings of the Sixth Workshop on Languages and Compilers for Parallel Computing, pages 461-476, August 1993. Published as Lecture Notes in Computer Science, number 768.
5. [CFR+91] R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems. 13(4):451-490, October 1991.
6. [CFS90] Ron Cytron, Jeanne Ferrante, Vivek Sarkar. Compact representations for control dependence In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 337-351, White Plains, New York, June 20-22, 1990.
7. [Cha86] Bernard Chazelle. Filtering search: A new approach to query answering. SIAM Journal of Computing, 15:703-724,1986.
8. [CicBC] Marcus Tullius Cicero. Pro L. Cornelio Balbo Oratio 39. Published by Senate of Rome, Rome, 56 BC.
9. [CLR92] Thomas Cormen Charles Leiserson Ronald Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA 1992.
10. [Fis81] Josh Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers. 7(3):478-490,1981.
11. [FOW87] J. Ferrante, K. J. Ottenstein, 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.
12. [GPS90] Rajiv Gupta, Lori Pollock, Mary Lou Soffa. Parallelizing data flow analysis. In Proceedings of the Workshop on Parallel Compilation, Kingston, Ontario, May 6-8, 1990. Queen's University.
13. [GS87] Rajiv Gupta and Mary Lou Soffa Region scheduling. In 2nd International Conference on Supercomputing, pages 141-148, 1987.
14. [Har85] D. Harel. A linear time algorithm for finding dom-inators in flowgraphs and related problems. In Proceedings of the 17th ACM Symposium on Theory of Computing, pages 185-194, Providence, Rhode Island, May 6-8, 1985.
15. [HPR87] Susan Horowitz, Jan Prins, Thomas Reps. Integrating non-interfering versions of programs. In Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages, pages 133-145, Munich, West Germany, January 21-23, 1987.
16. [Joh94] Richard Johnson. Efficient Program Analysis using Dependence Flow Graphs. PhD thesis, Cornell University, August 1994.
17. [JP93] Richard Johnson and Keshav Pingali Dependence-based program analysis. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 78-89, Albuquerque, New Mexico, June 23-25, 1993.
18. [JPP94] Richard Johnson, David Pearson, Keshav Pingali. The program structure tree: Computing control regions in linear time. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, pages 171-185, Orlando, Florida, June 20-24,1994.
19. [LT79] Thomas Lengauer and Robert Endre Tarj an. A fast al-gorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems, 1(1): 121-141, July 1979.
20. [Mic68] D. Michie. 'Memo' functions and machine learning. Nature, 218:19-22, April 1968.
21. [PBJ+91] Keshav Pingali, Micah Beck, Richard Johnson, Mayan Moudgill, Paul Stodghill. Dependence Flow Graphs: An algebraic approach to program dependencies. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages, pages 67-78, January 1991.
22. [Pod93] Andy Podgurski. Reordering-transformations that preserve control dependence. Technical Report CES-93-16, Case Western Reserve University, July 1993.
23. [SG95] Vugranam C. Sreedhar and Guang R. Gao. A lin-ear time algorithm for placing-nodes. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 62-73, San Francisco, California, January 1995.
24. [SGL94] Vugranam C. Sreedhar Guang R. Gao Yong-fong Lee. DJ-graphs and their applications to flow-graph analyses. Technical Report ACAPS Memo 70 McGill University, May, 1994.
25. [SS70] R. M. Shapiro and H. Saint. The representation of algorithms. Technical Report CA-7002-1432, Massachusetts Computer Associates, February 1970.
26. [SS93] A. Segre and D. Scharstein. Bounded-overhead caching for definite-clause theorem proving. Journal of Automated Reasoning, 11:83-113, August 1993.
27. [VEBKZ77] P. Van Emde Boas, R. Kaas, E. Zijlstra. Design and implementation of an efficient priority queue. Mathemetical Systems Theory, 10:99-127, 1977.