Spill code minimization via interference region spilling
@inproceedings{Bergner1997SpillCM, title={Spill code minimization via interference region spilling}, author={P. Bergner and P. Dahl and David Engebretsen and M. O'Keefe}, booktitle={PLDI '97}, year={1997} }
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… CONTINUE READING
Figures and Topics from this paper
86 Citations
Spill code minimization by spill code motion
- Computer Science
- 2003 12th International Conference on Parallel Architectures and Compilation Techniques
- 2003
- 5
A Framework for Enhancing Code Quality in Limited Register Set Embedded Processors
- Computer Science
- LCTES
- 2000
- 8
Register allocation and spilling using the expected distance heuristic
- Computer Science
- Softw. Pract. Exp.
- 2016
Achieving spilling-friendly register file assignment for highly distributed register files
- Computer Science
- The Journal of Supercomputing
- 2014