Kong and 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 == ? Probably also dependent on the ILP solver () == Description == Integer programming for irregular register architectures == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference == https://dl.acm.org/doi/10.5555/290940.291002")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

? Probably also dependent on the ILP solver

()

Description

Integer programming for irregular register architectures

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1998

Reference

https://dl.acm.org/doi/10.5555/290940.291002

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Kong_and_Wilken_Algorithm_(Global_Register_Allocation_Register_Allocation)&oldid=45376"