Demand-Driven Register Allocation (Global Register Allocation Register Allocation)
Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ words (Derived: Requires storing a so-called $\Delta$-table of size $n \times n$ to keep track of $\Delta$-estimates) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1996 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/236114.236117")
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$ words
(Derived: Requires storing a so-called $\Delta$-table of size $n \times n$ to keep track of $\Delta$-estimates)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1996
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/236114.236117