Linear scan register allocation on SSA form
@inproceedings{Wimmer2010LinearSR, title={Linear scan register allocation on SSA form}, author={C. Wimmer and M. Franz}, booktitle={CGO '10}, year={2010} }
The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Although most of these compilers use static single assignment (SSA) form, the algorithm has not yet been applied on SSA form, i.e., SSA form is usually deconstructed before register allocation. However, the structural properties of SSA form can be used to simplify the algorithm.
With only one definition per variable… CONTINUE READING
Supplemental Presentations
Figures and Topics from this paper
50 Citations
A decoupled non-SSA global register allocation using bipartite liveness graphs
- Computer Science
- TACO
- 2013
- 4
Trace Register Allocation Policies: Compile-time vs. Performance Trade-offs
- Computer Science
- ManLang
- 2017
- 3
- PDF
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
References
SHOWING 1-2 OF 2 REFERENCES