Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/iterated-register-coalescing-gzI184YFn6
References (19)
-
A. Appel, David MacQueen (1991)
Standard ML of New Jersey -
G. Chaitin (1982)
Register allocation & spilling via graph coloring -
X. Leroy (1992)
Unboxed objects and polymorphic typing -
A. Kempe (1879)
On the Geographical Problem of the Four ColoursAmerican Journal of Mathematics, 2
-
N. Adams, D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin (1986)
ORBIT: an optimizing compiler for scheme -
(1995)
Iterated register co- alescing -
(1995)
Received October -
Andrew Appel (1991)
Compiling with Continuations -
G. Chaitin, M. Auslander, A. Chandra, J. Cocke, Martin Hopkins, Peter Markstein (1981)
Register Allocation Via ColoringComput. Lang., 6
-
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,'' -
Fred Chow (1988)
Minimizing register usage penalty at procedure calls -
P. Briggs, L. Torczon (1993)
An efficient representation for sparse setsLOPLAS, 2
-
A. Appel, Zhong Shao (1992)
Callee-save registers in continuation-passing styleLISP and Symbolic Computation, 5
-
R. Cytron, J. Ferrante, B. Rosen, M. Wegman, F. Zadeck (1991)
Efficiently computing static single assignment form and the control dependence graphACM Trans. Program. Lang. Syst., 13
-
P. Briggs, K. Cooper, L. Torczon (1994)
Improvements to graph coloring register allocationACM Trans. Program. Lang. Syst., 16
-
N. Jones, Anders Gomard, Olivier Bondorf, Torben Danvy (1997)
’ s introduction to the Special Section on the Third International Conference on Computer Languages -
Zhong Shao, A. Appel (1995)
A type-based compiler for standard ML -
Zhong Shao, A. Appel (1994)
Space-efficient closure representations -
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1996 by ACM Inc.
- ISSN
- 0164-0925
- DOI
- 10.1145/229542.229546
- Publisher site
- See Article on Publisher Site
Abstract
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 Briggs's algorithm is too conservative and leaves too many move instructions in our programs. We show how to interleave coloring reductions with Briggs's coalescing heuristic, leading to an algorithm that is safe but much more aggressive.
Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) – Association for Computing Machinery
Published: May 1, 1996