Improvements to graph coloring register allocation

@article{Briggs1994ImprovementsTG,
  title={Improvements to graph coloring register allocation},
  author={P. Briggs and K. D. Cooper and Linda Torczon},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1994},
  volume={16},
  pages={428-455}
}
  • P. Briggs, K. D. Cooper, Linda Torczon
  • Published 1994
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • We describe two improvements to Chaitin-style graph coloring register allocators. The first, optimistic coloring, uses a stronger heuristic to find a k-coloring for the interference graph. The second extends Chaitin's treatment of rematerialization to handle a larger class of values. These techniques are complementary. Optimistic coloring decreases the number of procedures that require spill code and reduces the amount of spill code when spilling is unavoidable. Rematerialization lowers the… CONTINUE READING
    393 Citations

    Figures, Tables, and Topics from this paper

    Graph-coloring and treescan register allocation using repairing
    • 10
    • PDF
    A COMBINED ALGORITHM FOR GRAPH-COLORING IN REGISTER ALLOCATION
    • 9
    • PDF
    An Analysis of Graph Coloring Register Allocation
    • 6
    • PDF
    Preference-directed graph coloring
    • 17
    Tailoring graph-coloring register allocation for runtime compilation
    • 18
    • PDF
    Build Simplify Potential Spill Select Actual Spill Coloring Heuristic
    • Highly Influenced
    • PDF
    Register Allocation with Graph Coloring by Ant Colony Optimization
    • 5
    • PDF
    Iterated register coalescing
    • 126

    References

    SHOWING 1-3 OF 3 REFERENCES
    Register Allocation Via Coloring
    • 571
    • Highly Influential
    • PDF
    Register allocation via graph coloring
    • 148
    • Highly Influential
    • PDF
    A methodology for the real world
    • 597
    • Highly Influential