Register Allocation in Structured Programs

Journal of Algorithms

Volumn 29, Issue 2, 1998, Pages 223-237

  Kannan, Sampath ^a   Proebsting, Todd ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003792004     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0956     Document Type: Article

References (16)

1. A. Aho, J. Hopcroft, and J. Ullman, "The Design and Analysis of Algorithms," Addison-Wesley, Reading, MA, 1974.
2. A. V. Aho, R. Sethi, and J. D. Ullman, "Compilers: Principles, Techniques, and Tools," Addison-Wesley, Reading, MA, 1986.
3. P. Briggs, K. Cooper, and L. Torczon, "Aggressive Live Range Splitting," Technical report, Rice University, 1991.
4. P. Briggs, "Register Allocation via Graph Coloring," Ph.D. thesis, Rice University, Houston, TX, 1992.
5. P. Briggs, K. D. Cooper, and L. Torczon, Improvements to graph coloring register allocation, ACM Trans. Programming Languages Syst. 16(3) (May 1994), 428-455.
6. D. Callahan and B. Koblenz, Register allocation via hierarchical graph coloring, in "Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, June 1991," pp. 192-203.
7. G. J. Chaitin, Register allocation & spilling via graph coloring, in "Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction, June 1982," pp. 98-101.
8. F. C. Chow and J. L. Hennessy, The priority-based coloring approach to register allocation, ACM Trans. Programming Languages Syst. 12(4) (Oct. 1990), 501-536.
9. R. Gupta, M. L. Soffa, and D. Ombres, Efficient register allocation via coloring using clique separators, ACM Trans. Programming Languages Syst. 16(3) (May 1994), 370-386.
10. 5/2) algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973), 225-231.
11. P. Kelsen and V. Ramachandran, On finding minimal two-connected subgraphs, J. Algorithms 18 (1995).
12. S. M. Kurlander, C. N. Fischer, and T. A. Proebsting, Efficient instruction scheduling for delayed-load architectures, ACM Trans. Programming Languages Syst. 17(5) (Sept. 1995), 740-776.
13. J. Naor, M. Naor, and A. Schäffer, Fast parallel algorithms for chordal graphs, in "The Nineteenth ACM STOC, May 25-27, 1987," New York, pp. 355-364.
14. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, in "The Twentieth ACM STOC, May 2-4, 1988," Chicago, pp. 229-234.
15. S. Pinter, Register allocation with instruction scheduling: A new approach, in "Proceedings of the ACM-SIGPLAN-PLDI, Albuquerque, June 1993," Albuquerque, NM, pp. 248-257.
16. Mikkel Thorup, personal communication.