Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O(r)$ words
(Derived: given the live ranges, the only auxiliary data structure is an "active" list that contains the active live ranges and this has length at most $r$)
Description
Greedy assignment
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1999
Reference
http://web.cs.ucla.edu/~palsberg/course/cs132/linearscan.pdf