Graph Coloring Register Allocation
Graph Coloring Register Allocation is a register allocation method that models the assignment of program variables to processor registers as a graph coloring problem, where variables correspond to nodes and conflicts between simultaneously live variables form edges, such that assigning the same color (register) to non-adjacent nodes minimizes register usage while preserving semantic correctness.
78
Publications
6.5K
Citations
126
Authors
55
Institutions
Publications per year
2017–2026
2
Parents
78
Register allocation & spilling via graph coloring
Gregory J. Chaitin · ACM SIGPLAN Notices · 1982 · 767 citations · Full text
Register allocation via coloring
Gregory J. Chaitin, Marc Auslander, Ashok K. Chandra et al. · Computer Languages · 1981 · 731 citations
Register allocation & spilling via graph coloring
Gregory J. Chaitin · 1982 · 668 citations
1–5 of 78
126
9
h-index
8
h-index
8
h-index
4
h-index
4
h-index
1–5 of 126
55

Rice University
Houston, United States
10 h-index
34 publications
3.2K citations
Princeton University
Princeton, United States
6 h-index
10 publications
617 citations
University of Michigan
Ann Arbor, United States
5 h-index
11 publications
263 citations
IBM (United States)
Armonk, United States
5 h-index
12 publications
6.2K citations
University of Pittsburgh
Pittsburgh, United States
4 h-index
6 publications
154 citations
University of California, Davis
Davis, United States
4 h-index
6 publications
262 citations

TU Wien
Vienna, Austria
3 h-index
4 publications
128 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
2 publications
456 citations
1–8 of 55
16 publications · 1.3K citations
13
h-index
7 publications · 1.5K citations
7
h-index
4 publications · 149 citations
4
h-index
LOPLAS · 2 publications · 120 citations
2
h-index
Conference · 1 publications · 16 citations
1
h-index
1–5