Optimistic register coalescing

@article{Park2004OptimisticRC,
  title={Optimistic register coalescing},
  author={Jinpyo Park and Soo-Mook Moon},
  journal={ACM Trans. Program. Lang. Syst.},
  year={2004},
  volume={26},
  pages={735-765}
}
  • Jinpyo Park, Soo-Mook Moon
  • Published 2004
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • Graph-coloring register allocators eliminate copies by coalescing the source and target nodes of a copy if they do not interfere in the interference graph. Coalescing, however, can be harmful to the colorability of the graph because it tends to yield a graph with nodes of higher degrees. Unlike aggressive coalescing, which coalesces any pair of noninterfering copy-related nodes, conservative coalescing or iterated coalescing perform safe coalescing that preserves the colorability. Unfortunately… CONTINUE READING
    46 Citations
    Copy coalescing by graph recoloring
    • 31
    • Highly Influenced
    Live-range unsplitting for faster optimal coalescing
    • 6
    • PDF
    Graph-coloring and treescan register allocation using repairing
    • 10
    • PDF
    Optimistic chordal coloring: a coalescing heuristic for SSA form programs
    • 1
    • Highly Influenced
    • PDF
    Elimination of parallel copies using code motion on data dependence graphs
    • 2

    References

    SHOWING 1-4 OF 4 REFERENCES
    Register allocation via graph coloring
    • 196
    • Highly Influential
    Register allocation & spilling via graph coloring
    • 566
    • Highly Influential
    • PDF
    The priority-based coloring approach to register allocation
    • 345
    • Highly Influential
    • PDF
    Spill code minimization via interference region spilling
    • 86
    • Highly Influential