Quality and Speed in Linear-scan Register Allocation (1998)
Cached
Download Links
- [www.eecs.harvard.edu]
- [ftp.das.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 71 - 1 self |
BibTeX
@MISC{Traub98qualityand,
author = {Omri Traub and Glenn Holloway and Michael D. Smith},
title = {Quality and Speed in Linear-scan Register Allocation},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register allocation makes sense for systems, such as those for dynamic compilation, where compilation speed is important. In contrast, most commercial and research optimizing compilers rely on a graph-coloring approach to global register allocation. In this paper, we compare the performance of a linear-scan method against a modern graph-coloring method. We implement both register allocators within the Machine SUIF extension of the Stanford SUIF compiler system. Experimental results show that linear scan is much faster than coloring on benchmarks with large numbers of register candidates. We also describe improvements to the linear-scan approach that do not change its linear character, but allow it to produce code of a quality near to that produced by graph coloring. Keywords: global register allocation, graph colorin...
Keyphrases
linear-scan register allocation register candidate global register allocation graph-coloring approach modern graph-coloring method dynamic compilation machine suif extension linear-scan method linear-scan algorithm register allocator graph colorin linear-scan approach simple linear sweep large number linear character stanford suif compiler system graph coloring experimental result global allocation compilation speed
