Optimal Register Allocation (ORA), Goodwin & Wilken Algorithm (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^{3})$ == Space Complexity == Depends on the choice of {0}-{1} ILP solver ("Memory usage is dominated by the usage of the integer program solver.") == Description == 0-1 integer linear programming problem == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference == https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291097-024X%28199608%2926%3A8%3C929%3A%3AA...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

Depends on the choice of {0}-{1} ILP solver

("Memory usage is dominated by the usage of the integer program solver.")

Description

0-1 integer linear programming problem

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1996

Reference

https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291097-024X%28199608%2926%3A8%3C929%3A%3AAID-SPE40%3E3.0.CO%3B2-T

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Optimal_Register_Allocation_(ORA),_Goodwin_%26_Wilken_Algorithm_(Global_Register_Allocation_Register_Allocation)&oldid=45375"