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}
}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
Supplemental Presentations
Figures and Topics from this paper
176 Citations
Optimistic coalescing for heterogeneous register architectures
- Computer Science
- LCTES '07
- 2007
- 4
- Highly Influenced
Register coalescing techniques for heterogeneous register architecture with copy sifting
- Computer Science
- TECS
- 2009
- 1
- PDF
On the Complexity of Register Coalescing
- Computer Science
- International Symposium on Code Generation and Optimization (CGO'07)
- 2007
- 48
- Highly Influenced
- PDF
References
SHOWING 1-5 OF 5 REFERENCES