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}
}
  • M. Poletto, Vivek Sarkar
  • Published 1999
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • 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
    353 Citations
    Efficient global register allocation
    • Highly Influenced
    • PDF
    A Modified Linear Scan Register Allocation Algorithm
    • S. Subha
    • Computer Science
    • 2009 Sixth International Conference on Information Technology: New Generations
    • 2009
    • 2
    Register Allocation with Graph Coloring by Ant Colony Optimization
    • 5
    • PDF
    Optimized interval splitting in a linear scan register allocator
    • 72
    • PDF
    SSA-Form-Based Register Allocation for the Java HotSpot
    • 2010
    Extended Linear Scan: An Alternate Foundation for Global Register Allocation
    • 42
    • PDF

    References

    Combining Register Allocation
    • 1995