20 search results - page 1 / 4 » Tailoring Graph-coloring Register Allocation For Runtime Com... |
CGO
2006
IEEE
13 years 11 months ago
2006
IEEE
Just-in-time compilers are invoked during application execution and therefore need to ensure fast compilation times. Consequently, runtime compiler designers are averse to impleme...
LCPC
2005
Springer
13 years 10 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
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...
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...
PLDI
2004
ACM
13 years 10 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...