Optimal spilling for CISC machines with few registers
@inproceedings{Appel2001OptimalSF, title={Optimal spilling for CISC machines with few registers}, author={Andrew W. Appel and L. George}, booktitle={PLDI '01}, year={2001} }
Many graph-coloring register-allocation algorithms don't work well for machines with few registers. Heuristics for live-range splitting are complex or suboptimal; heuristics for register assignment rarely factor the presence of fancy addressing modes; these problems are more severe the fewer registers there are to work with. We show how to optimally split live ranges and optimally use addressing modes, where the optimality condition measures dynamically weighted loads and stores but not… CONTINUE READING
Figures and Topics from this paper
153 Citations
A faster optimal register allocator
- Computer Science
- 35th Annual IEEE/ACM International Symposium on Microarchitecture, 2002. (MICRO-35). Proceedings.
- 2002
- 14
Graph-coloring and treescan register allocation using repairing
- Computer Science
- 2011 Proceedings of the 14th International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES)
- 2011
- 10
- PDF
A progressive register allocator for irregular architectures
- Computer Science
- International Symposium on Code Generation and Optimization
- 2005
- 30
- PDF
A decoupled non-SSA global register allocation using bipartite liveness graphs
- Computer Science
- TACO
- 2013
- 4
References
Optimal and near-optimal global register allocations using 0–1 integer programming
- Computer Science
- 1996
- 103
- Highly Influential