4 search results - page 1 / 1 » Revisiting Graph Coloring Register Allocation: A Study of th... |
LCPC
2005
Springer
14 years 1 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 ā...
CGO
2007
IEEE
14 years 2 months ago
2007
IEEE
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
ICALP
2007
Springer
14 years 1 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 deļ¬nition point if the bank of regis...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...