Demand-Driven Register Allocation

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 6, 1996, Pages 683-710

  Proebsting, Todd A ^a,c   Fischer, Charles N ^b,d  

^a UNIVERSITY OF ARIZONA   (United States)

^b UNIVERSITY OF WISCONSIN   (United States)

^c University of Arizona   (United States)

^d University of Wisconsin   (United States)

Author keywords

Algorithms; D.3.4 Programming Languages : Processors Code generation; optimization; Languages; Optimizing compiler; Performance; Theory

Indexed keywords

ALGORITHMS; BLOCK CODES; OPTIMIZATION; PROGRAM COMPILERS;

CODE GENERATION; DEMAND DRIVEN REGISTER ALLOCATION; GLOBAL ALLOCATION; LOCAL ALLOCATION;

PROGRAM PROCESSORS;

EID: 0030287935     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/236114.236117     Document Type: Article

References (17)

1. BALL, T. AND LARUS, J. R. 1992. Optimally profiling and tracing programs. In Proceedings of the 19th Annual Symposium on Principles of Programming Languages. ACM, New York, 59-70.
2. BEATTY, J. C. 1974. Register assignment algorithm for generation of highly optimized object code. IBM J. Res. Devel. 18, 1 (Jan.), 20-39.
3. BRIGGS, P., COOPER, K. D., KENNEDY, K., AND TORCZON, L. 1989. Coloring heuristics for register allocation. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation. ACM, New York, 275-284.
4. CALLAHAN, D. AND KOBLENZ, B. 1991. Register allocation via hierarchical graph coloring. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation. ACM, New York, 192-203.
5. CHAITIN, G. J. 1982. Register allocation and spilling via graph coloring. In Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction. ACM, New York, 98-101.
6. CHAITIN, G. J., AUSLANDER, M. A., CHANDRA, A. K., COOKE, J., HOPKINS, M. E., AND MARKSTEIN, P. W. 1981. Register allocation via graph coloring. Comput. Lang. 6, 47-57.
7. CHOW, F. C. AND HENNESSY, J. L. 1990. The priority-based coloring approach to register allocation. ACM Trans. Program. Lang. Syst. 12, 4 (Oct.), 501-536.
8. FISCHER, C. N. AND LEBLANC. 1988. Crafting a Compiler. Benjamin/Cummings, Menlo Park, Calif.
9. FRASER, C. W. AND HANSON, D. R. 1991a. A code generation interface for ANSI C. Softw. Pract. Exper. 21, 9 (Sept.), 963-988.
10. FRASER, C. W. AND HANSON, D. R. 1991b. A retargetable compiler for ANSI C. SIGPLAN Not. 26, 10 (Oct.), 29-43.
11. FREIBURGHOUSE, R. A. 1974. Register allocation via usage counts. Commun. ACM 17, 11 (Nov.).
12. HSU, W.-C., FISCHER, C. N., AND GOODMAN, J. R. 1989. On the minimization of loads/stores in local register allocation. IEEE Trans. Softw. Eng. 15, 10, 1252-1260.
13. LARUS, J. R. AND HILFINGER, P. N. 1986. Register allocation in the SPUR lisp compiler. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction. ACM, New York, 255-263.
14. MOREL, E. AND RENVOISE, C. 1979. Global optimization by suppression of partial redundancies. Commun. ACM 22, 96-103.
15. MORRIS, W. G. 1991. CCG: A prototype coagulating code generator. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation. ACM, New York, 45-58.
16. PROEBSTING, T. A. AND FISCHER, C. N. 1992. Probabilistic register allocation. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation. ACM, New York, 300-301.
17. WALL, D. W. 1986. Global register allocation at link time. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction. ACM, New York, 264-275.