Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 471 bytes +471‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Linear_Scan,_Poletto_%26_Sarkar_(Global_Register_Allocation_Register_Allocation)"