An Optimistic and Conservative Register Assignment Heuristic for Chordal Graphs

DMCA

An Optimistic and Conservative Register Assignment Heuristic for Chordal Graphs (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Philip Brisk , Ajay K. Verma , Paolo Ienne

Citations:

4 - 0 self

BibTeX

@MISC{Brisk07anoptimistic,
    author = {Philip Brisk and Ajay K. Verma and Paolo Ienne},
    title = {An Optimistic and Conservative Register Assignment Heuristic for Chordal Graphs},
    year = {2007}
}

OpenURL

Abstract

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 optimal or near-optimal solutions for these graphs. OCC ran 1.89x faster than IRC, on average.

Keyphrases

chordal graph conservative register assignment heuristic interference graph copy instruction new register assignment heuristic several mediabench iterated register coalescing chordal interference graph optimistic chordal coloring ssa form graph coloring near-optimal solution previous register assignment heuristic node merging mibench application chromatic number many case ssa-based register allocation chordal graph property

DMCA