Sciweavers

287 search results - page 1 / 58
» On the Complexity of Register Coalescing
Sort
View
CGO
2007
IEEE
13 years 11 months ago
On the Complexity of Register Coalescing
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 ...
Florent Bouchez, Alain Darte, Fabrice Rastello
IEEEPACT
1998
IEEE
13 years 8 months ago
Optimistic Register Coalescing
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
Jinpyo Park, Soo-Mook Moon
CC
2010
Springer
155views System Software» more  CC 2010»
13 years 11 months ago
Preference-Guided Register Assignment
Abstract. This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally conside...
Matthias Braun, Christoph Mallon, Sebastian Hack
APLAS
2005
ACM
13 years 10 months ago
Register Allocation Via Coloring of Chordal Graphs
We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observa...
Fernando Magno Quintão Pereira, Jens Palsbe...
LCTRTS
2009
Springer
13 years 11 months ago
Live-range unsplitting for faster optimal coalescing
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Sandrine Blazy, Benoît Robillard