Preference-directed graph coloring

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2002, Pages 33-44

  Koseki, Akira ^a   Komatsu, Hideaki ^a   Nakatani, Toshio ^a  

^a IBM JAPAN LTD   (Japan)

Author keywords

Graph coloring; Irregular register architectures; Register allocation; Register coalescing

Indexed keywords

ALGORITHMS; COLORING; COMPUTER PROGRAMMING LANGUAGES; OPTIMIZATION; PROGRAM COMPILERS;

GRAPH COLORING;

COMPUTER GRAPHICS;

EID: 0036041151     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/512529.512535     Document Type: Conference Paper

References (25)

1. Complete register allocation problems
2. Register allocation and spilling via graph coloring
3. Improvements to graph coloring register allocation
4. The priority-based coloring approach to register allocation
5. Efficiently computing static single assignment form and the control dependence graph
6. Iterated register coalescing
7. Optimistic register coalescing
8. Call-cost directed register allocation
9. Design, implementation, and evaluation of optimizations if a just-in-time compiler
10. Optimal and near-optimal global register allocation using 0-1 integer programming
11. Precise register allocation for irregular architectures
12. Optimal spilling for CISC machines with few registers
13. OS and compiler considerations in the design of the IA-64 architecture
14. Register allocation via hierarchical graph coloring
15. Probabilistic register allocation
16. Global register allocation based on graph fusion
17. Spill code minimization via interference region spilling
18. Zero-cost range splitting
19. Using node merging to enhance graph coloring