Optimal register allocation for SSA-form programs in polynomial time
Inf. Process. Lett., pp. 150-155, 2006.
graph algorithmsregister allocation problemconstructive proofssa-form programcombinatorial problemsMore(4+)
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs.
Full Text (Upload PDF)
PPT (Upload PPT)