Optimal register allocation for SSA-form programs in polynomial time

Inf. Process. Lett., pp. 150-155, 2006.

Cited by: 43|Bibtex|Views4|Links
EI
Keywords:
graph algorithmsregister allocation problemconstructive proofssa-form programcombinatorial problemsMore(4+)

Abstract:

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.

Code:

Data:

Your rating :
0

 

Tags
Comments