DMCA
Spill Code Minimization via Interference Region Spilling (1997)
| Venue: | in SIGPLAN Conference on Programming Language Design and Implementation |
| Citations: | 41 - 1 self |
BibTeX
@INPROCEEDINGS{Bergner97spillcode,
author = {Peter Bergner and Peter Dahl and David Engebretsen and Matthew O'Keefe},
title = {Spill Code Minimization via Interference Region Spilling},
booktitle = {in SIGPLAN Conference on Programming Language Design and Implementation},
year = {1997},
pages = {287--295}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Many optimizing compilers perform global register allocation using a Chaitin-style graph coloring algorithm. Live ranges that cannot be allocated to registers are spilled to memory. The amount of code required to spill the live range depends on the spilling heuristic used. Chaitin's spilling heuristic offers some guidance in reducing the amount of spill code produced. However, this heuristic does not allow the partial spilling of live ranges and the reduction in spill code is limited to a local level. In this paper, we present a global technique called interference region spilling that improves the spilling granularity of any local spilling heuristic. Our technique works above the local spilling heuristic, limiting the normal insertion of spill code to a portion of each spilled live range. By partially spilling live ranges, we can achieve large reductions in dynamically executed spill code; up to 75% in some cases and an average of 33.6% across the benchmarks tested. 1 Introduction Gl...
