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

Authors

126

  1. KD
    Keith D. Cooper

    Rice University, United States

    9 publications · 862 citations

    9

    h-index

  2. LT
    Linda Torczon

    Rice University, United States

    8 publications · 877 citations

    8

    h-index

  3. PB
    Preston Briggs

    Rice University, United States

    8 publications · 877 citations

    8

    h-index

  4. GH
    Glenn Holloway

    Harvard University Press, United States

    4 publications · 238 citations

    4

    h-index

  5. LG
    Lal George

    Princeton University, United States

    4 publications · 446 citations

    4

    h-index

1–5 of 126

Venues

  1. ACM SIGPLAN Notices

    16 publications · 1.3K citations

    13

    h-index

  2. 7

    h-index

  3. Software Practice and Experience

    4 publications · 149 citations

    4

    h-index

  4. ACM Letters on Programming Languages and Systems

    LOPLAS · 2 publications · 120 citations

    2

    h-index

  5. Design, Automation, and Test in Europe

    Conference · 1 publications · 16 citations

    1

    h-index

1–5