Linear scan register allocation
@article{Poletto1999LinearSR, title={Linear scan register allocation}, author={M. Poletto and Vivek Sarkar}, journal={ACM Trans. Program. Lang. Syst.}, year={1999}, volume={21}, pages={895-913} }
We describe a new algorithm for fast global register allocation called linear scan. This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges. The linear scan algorithm is considerably faster than algorithms based on graph coloring, is simple to implement, and results in code that is almost as efficient as that obtained using more complex and time-consuming register allocators based on graph coloring. The… CONTINUE READING
Supplemental Presentations
Figures, Tables, and Topics from this paper
353 Citations
Linear Scan Register Allocation in the Context of SSA Form and Register Constraints
- Computer Science
- CC
- 2002
- 30
- PDF
A Modified Linear Scan Register Allocation Algorithm
- Computer Science
- 2009 Sixth International Conference on Information Technology: New Generations
- 2009
- 2
Register Allocation with Graph Coloring by Ant Colony Optimization
- Computer Science
- 2011 30th International Conference of the Chilean Computer Science Society
- 2011
- 5
- PDF
Extended Linear Scan: An Alternate Foundation for Global Register Allocation
- Computer Science
- CC
- 2007
- 42
- PDF
References
Combining Register Allocation
- 1995