Sciweavers

Share
IPL
2006

Optimal register allocation for SSA-form programs in polynomial time

9 years 11 months ago
Optimal register allocation for SSA-form programs in polynomial time
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. 2006 Elsevier B.V. All rights reserved.
Sebastian Hack, Gerhard Goos
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPL
Authors Sebastian Hack, Gerhard Goos
Comments (0)
books