2 search results - page 1 / 1 » Register Allocation After Classical SSA Elimination is NP-Co... |
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
CC
2009
Springer
14 years 5 months ago
2009
Springer
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...