• DOI:10.1145/330249.330250
Corpus ID: 18180752

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

View on ACM

cs.purdue.edu

Save to Library

Create Alert

Cite

Launch Research Feed