A generalized algorithm for graph-coloring register allocation

ACM SIGPLAN Notices

Volumn 39, Issue 6, 2004, Pages 277-288

  Smith, Michael D ^a   Ramsey, Norman ^a   Holloway, Glenn ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Graph coloring; Register allocation

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; GRAPH THEORY; IDENTIFICATION (CONTROL SYSTEMS); OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

CODE GENERATORS; GRAPH COLORING; REGISTER ALLOCATION;

PROGRAM COMPILERS;

EID: 4544279804     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/996893.996875     Document Type: Conference Paper

References (22)

1. Andrew W. Appel and Lal George. 2001 (May). Optimal spilling for CISC machines with few registers. In 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 243-253.
2. Andrew W. Appel and Jens Palsberg. 2002. Modern Compiler Implementation in Java. Cambridge University Press, 2nd edition.
3. Preston Briggs. 1992 (April). Register allocation via graph coloring. Technical Report TR92-183, Rice University, Department of Computer Science.
4. Preston Briggs, Keith Cooper, and Linda Torczon. 1992 (March). Coloring register pairs. ACM Letters on Programming Languages and Systems, 1(1):3-13.
5. Preston Briggs, Keith Cooper, and Linda Torczon. 1994 (May). Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems, 16(3): 428-455.
6. Gregory J. Chaitin. 1982. Register allocation and spilling via graph coloring. In 7982 SIGPLAN Symposium on Compiler Construction, pages 98-105.
7. Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. 1981. Register allocation via coloring. Computer Languages, 6(1):47-57.
8. Keith Cooper and Linda Torczon. 2003. Engineering a Compiler. Morgan Kaufmann.
9. Changqing Fu and Kent D. Wilken. 2002 (November). A faster optimal register allocator. In 35th ACM/IEEE International Symposium on Microarchitecture, pages 245-256.
10. Lal George and Andrew W. Appel. 1996 (May). Iterated register coalescing. ACM Transactions on Programming Languages and Systems, 18(3):300-324.
11. David W. Goodwin and Kent D. Wilken. 1996 (August). Optimal and near-optimal global register allocations using 0-1 integer programming. Software-Practice & Experience, 26(8):929-965.
12. Ulrich Hirnschrott, Andreas Krall, and Bernhard Scholz. 2003 (August). Graph coloring vs. optimal register allocation for optimizing compilers. In Joint Modular Languages Conference, volume 2789 of Lecture Notes in Computer Science, pages 202-213. Springer Press, Klagenfurt, Austria.
13. Richard E. Kessler, Edward J. McLellan, and David A. Webb. 1998 (October). The Alpha 21264 microprocessor architecture. In International Conference on Computer Design, pages 90-95.
14. Timothy Kong and Kent D. Wilken. 1998 (December). Precise register allocation for irregular architectures. In 31st ACM/IEEE International Symposium on Microarchitecture, pages 297-307.
15. Akira Koseki, Hideaki Komatsu, and Toshio Nakatani. 2002 (June). Preference-directed graph coloring. In 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 33-44.
16. Chunho Lee, Miodrag Potkonjak, and William H. Mangione-Smith. 1997 (December). MediaBench: a tool for evaluating and synthesizing multimedia and communications systems. In 30th ACM/IEEE International Symposium on Microarchitecture, pages 330-335.
17. Allen Leung and Lal George. 1998. A new MLRISC register allocator. Standard ML of New Jersey compiler implementation notes.
18. Michael Matz. 2003 (May). Design and implementation of a graph coloring register allocator for GCC. In GCC Developers Summit, pages 151-170.
19. Steven S. Muchnick. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann.
20. Brian R. Nickerson. 1990 (June). Graph coloring register allocation for processors with multi-register operands. In 1990 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 40-52.
21. Johan Runeson and Sven-Olof Nyström. 2003 (September). Retargetable graph-coloring register allocation for irregular architectures. In Software and Compilers for Embedded Systems (SCOPES), volume 2826 of Lecture Notes in Computer Science, pages 240-254. Springer Press, Klagenfurt, Austria.
22. Bernhard Scholz and Erik Eckstein. 2002 (June). Register allocation for irregular architectures. In Proceedings of the Joint Conference on Languages, Compilers and Tools for Embedded Systems, pages 139-148.