35 search results - page 3 / 7 » Register Allocation Via Coloring of Chordal Graphs |
CC
1998
Springer
13 years 5 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
DAC
2009
ACM
14 years 6 months ago
2009
ACM
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
CGO
2010
IEEE
13 years 11 months ago
2010
IEEE
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...