51 search results - page 1 / 11 » Coloring Heuristics for Register Allocation |
PLDI
1989
ACM
13 years 9 months ago
1989
ACM
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...
ESOP
2010
Springer
14 years 2 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
CC
2006
Springer
13 years 9 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
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...