Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation)

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Linear_Scan,_Poletto_%26_Sarkar_(Global_Register_Allocation_Register_Allocation)&oldid=45373"