Register Allocation via Hierarchical Graph Coloring

ACM SIGPLAN Notices

Volumn 26, Issue 6, 1991, Pages 192-203

  Callahan, David ^a   Koblenz, Brian ^a  

^a CRAY INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976675935     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/113446.113462     Document Type: Article

References (16)

1. F. E. Allen. Control Flow Analysis. In Proceedings of the SIGPLAN ‘70 Symposium on Compiler Construction, pages 1-19, July 1970.
2. D. Bernstein, D. Goldin, M. Golumbic, H. Krawczyk, Y. Mansour, I. Nahshon, and R. Pinter. Spill code minimization techniques for optimizing compilers. In Proceedings of the ACM SIGPLAN 89 Conference on Program Language Design and Implementation, pages 258-263, June 1989.
3. P. Briggs, K. Cooper, K. Kennedy, and L. Torczon. Coloring Heuristics for Register Allocation. In Proceedings of the ACM SIGPLAN 89 Conference on Program Language Design and Implementation, pages 275-284, June 1989.
4. P. Briggs, K. Cooper, and L. Torczon. Aggressive Live range Splitting. Technical report, Rice University, 1991.
5. D. Callahan, S. Carr, and K. Kennedy. Improving Register Allocation for Subscripted Variables. In Proceedings of the ACM SIGPLAN 90 Conference on Program Language Design and Implementation, pages 53-65, June 1990.
6. G. Chaitin. Register Allocation and Spilling via Graph Coloring. In Proceedings of the SIGPLAN ‘82 Symposium on Compiler Construction, pages 98-105, June 1982.
7. F. Chow. Minimizing Register Usage Penalty at Procedure Calls. In Proceedings of the ACM SIGPLAN 88 Conference on Program Language Design and Implementation, pages 85-94, June 1988.
8. F. Chow and J. Hennessy. Register Allocation by Priority-based Coloring. In Proceedings of
9. the SIGPLAN ‘84 Symposium on Compiler Construction, SIGPLAN Notices Vol. 19, No. 6, pages 222-232, June 1984.
10. R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. An Efficient Method of Computing Static Single Assignment Form. In Conference Record of the Sixteenth ACM Symposium on the Principles of Programming Languages, pages 25-35, January 1989.
11. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The Program Dependence Graph and Its Use in Optimization. ACM Transactions on Programming Languages and Systems, 9(3):319-349, July 1987.
12. R. Gupta, M. L. Soffa, and T. Steele. Register Allocation via Clique Separators. In Proceedings of the ACM SIGPLAN 89 Conference on Program Language Design and Implementation, pages 264-274, June 1989.
13. K. Knobe and A. Meltzer. Control Tree based Register Allocation. Technical report, COMPASS, 1990.
14. J. Larus and P. Hilfinger. Register Allocation in the SPUR Lisp Compiler. In Proceedings of the SIGPLAN ‘86 Symposium on Compiler Construction, SIGPLAN Notices Vol. 21, No. 7, pages 255-263, June 1986.
15. M. Sharir. Structural Analysis: A New Approach to Flow Analysis in Optimizing Compilers. Computer Languages, 5:151-153, 1980.
16. R. E. Tarjan. Testing Flow Graph Reducibility. Journal of Computer and System Sciences, 9:355-365, 1974.