Optimal Register Allocation (ORA), Goodwin & Wilken Algorithm (Global Register Allocation Register Allocation): Difference between revisions
Jump to navigation
Jump to search
(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...") |
No edit summary |
||
| Line 31: | Line 31: | ||
== Reference == | == Reference == | ||
https://onlinelibrary.wiley.com/doi | https://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-024X(199608)26:8%3C929::AID-SPE40%3E3.0.CO;2-T | ||
Latest revision as of 09:42, 10 April 2023
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