Sciweavers

35 search results - page 1 / 7
» Register Allocation Via Coloring of Chordal Graphs
Sort
View
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...
CASES
2007
ACM
13 years 8 months ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
13 years 11 months ago
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
Douglas E. Carroll, Adam Meyerson, Brian Tagiku
CC
2006
Springer
132views System Software» more  CC 2006»
13 years 8 months ago
Register Allocation for Programs in SSA-Form
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...
Sebastian Hack, Daniel Grund, Gerhard Goos
FOSSACS
2006
Springer
13 years 8 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...