Register allocation & spilling via graph coloring

ACM SIGPLAN Notices

Volumn 39, Issue 4, 2004, Pages 67-74

  Chaitin, G J ^a  

^a IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); GRAPH THEORY; OPTIMIZATION; SYSTEMS ANALYSIS; VECTORS;

GRAPH COLORING APPROACH; MACHINE REGISTERS; SPILLING PROBLEMS;

MICROCOMPUTERS;

EID: 3142752877     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/989393.989403     Document Type: Conference Paper

References (6)

1. "The 801 minicomputer," G. Radin, Proceedings of the ACM Symposium on Architectural Support for Programming Languages and Operating Systems, March 1-3, 1982, Palo Alto, California.
2. "The history of language processor technology in IBM," F.E. Allen, IBM Journal of Research and Development 25 (1981), pp. 535-548.
3. "Measurement of code improvement algorithms," J. Cocke, P.W. Markstein, Information Processing 80, S.H. Lavington (ed.), North-Holland, Amsterdam, 1980, pp. 221-228.
4. "Register allocation via coloring," G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cocke, M.E. Hopkins, P.W. Markstein, Computer Languages 6 (1981), pp. 47-57.
5. "Optimization of range checking," V. Markstein, J. Cocke, P. Markstein, this Proceedings.
6. "Higher Level Programming: Introduction to the Use of the Set-Theoretic Programming Language SETL," R.B.K. Dewar, E. Schonberg, J.T. Schwartz, Courant Institute, New York University, 1981.