33 search results - page 1 / 7 » Optimal register allocation for SSA-form programs in polynom... |
ICCAD
2007
IEEE
2007
IEEE
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
14 years 7 months ago
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
CGO
2010
IEEE
14 years 5 months ago
2010
IEEE
The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Altho...
FOSSACS
2006
Springer
14 years 2 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...
IPL
2006
13 years 10 months ago
2006
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 ...
IEEEPACT
2002
IEEE
14 years 3 months ago
2002
IEEE
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...