Register allocation & spilling via graph coloring

@inproceedings{Chaitin1982RegisterA,
  title={Register allocation & spilling via graph coloring},
  author={G. Chaitin},
  booktitle={SIGPLAN '82},
  year={1982}
}
  • G. Chaitin
  • Published in SIGPLAN '82 1982
  • Computer Science
  • In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an experimental PL/I optimizing compiler. When the compiler cannot color the register conflict graph with a number of colors equal to the number of available machine registers, it must add code to spill and reload registers to and from storage. Previously the compiler produced spill code whose quality sometimes left much to be desired, and the ad hoe techniques used took… CONTINUE READING
    557 Citations

    Topics from this paper.

    A COMBINED ALGORITHM FOR GRAPH-COLORING IN REGISTER ALLOCATION
    • 9
    • PDF
    Register Allocation with Graph Coloring by Ant Colony Optimization
    • 5
    • PDF
    Optimal Register Allocation in Polynomial Time
    • 18
    • PDF
    Live Range Splitting in a Graph Coloring Register Allocator
    • 50
    • Highly Influenced
    • PDF
    An improved approach of register allocation via graph coloring
    • L. Gao, Ce Shi
    • Engineering, Computer Science
    • IS&T/SPIE Electronic Imaging
    • 2005
    • 1
    Register Allocation Based on a Reference Flow Analysis
    Graph-coloring and treescan register allocation using repairing
    • 10
    • PDF
    Register-file allocation via graph coloring
    Build Simplify Potential Spill Select Actual Spill Coloring Heuristic