Iterated register coalescing

@article{George1996IteratedRC,
  title={Iterated register coalescing},
  author={L. George and Andrew W. Appel},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1996},
  volume={18},
  pages={300-324}
}
  • L. George, Andrew W. Appel
  • Published 1996
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • An important function of any register allocator is to target registers so as to eliminate copy instructions. Graph-coloring register allocation is an elegant approach to this problem. If the source and destination of a move instruction do not interfere, then their nodes can be coalesced in the interference graph. Chaitin's coalescing heuristic could make a graph uncolorable (i.e., introduce spills); Briggs et al. demonstrated a conservative coalescing heuristic that preserves colorability. But… CONTINUE READING
    176 Citations
    Iterated register coalescing
    • 126
    Improvements to Conservative and Optimistic Register Coalescing
    • PDF
    Optimistic coalescing for heterogeneous register architectures
    • 4
    • Highly Influenced
    Optimal spilling for CISC machines with few registers
    • 153
    • PDF
    Advanced conservative and optimistic register coalescing
    • 13
    • PDF
    Copy elimination on data dependence graphs
    On the Complexity of Register Coalescing
    • 48
    • Highly Influenced
    • PDF
    Comparing conservative coalescing criteria
    • 5
    • PDF

    References

    SHOWING 1-5 OF 5 REFERENCES
    Improvements to graph coloring register allocation
    • 393
    • Highly Influential
    • PDF
    Register allocation and spilling via graph coloring
    • 558
    • Highly Influential
    • PDF
    A methodology for the real world
    • 597
    • Highly Influential
    An efficient representation for sparse sets
    • 92
    • Highly Influential
    • PDF
    ORBIT: an optimizing compiler for scheme
    • 294
    • Highly Influential
    • PDF