DMCA
Iterated Register Coalescing (1996)
Cached
Download Links
- [ftp.cs.princeton.edu]
- [www.cs.princeton.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 158 - 4 self |
BibTeX
@ARTICLE{George96iteratedregister,
author = {Lal George},
title = {Iterated Register Coalescing},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1996},
volume = {18},
pages = {300--324}
}
Share
 |
 |
 |
 |
||
OpenURL
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. 1 Introduction Graph coloring is a powerful approach to register allocation and can have a significant impact on the execution of compiled code. A good register allocator does copy propagation, eliminating many move instructions by "coloring" the source tempor...
Keyphrases
good register allocator graph-coloring register allocation copy instruction important function powerful approach source tempor register allocator compiled code coalescing heuristic introduction graph coloring interference graph move instruction many move instruction elegant approach significant impact conservative coalescing
