Sciweavers

Share
CASES
2007
ACM

An optimistic and conservative register assignment heuristic for chordal graphs

8 years 9 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). Previous register assignment heuristics eliminate copy instructions via coalescing, in other words, merging nodes in the interference graph. Node merging, however, can not preserve the chordal graph property, making it unappealing for SSA-based register allocation. OCC is based on graph coloring, but does not employ coalescing, and, consequently, preserves graph chordality, and does not increase its chromatic number; in this sense, OCC is conservative as well as optimistic. OCC is observed to eliminate at least as many dynamically executed copy instructions as iterated register coalescing (IRC) for a set of chordal interference graphs generated from several Mediabench and MiBench applications. In many cases, OCC and IRC were able to find
Philip Brisk, Ajay K. Verma, Paolo Ienne
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where CASES
Authors Philip Brisk, Ajay K. Verma, Paolo Ienne
Comments (0)
books