How to build an interference graph

✍ Scribed by Keith D. Cooper; Timothy J. Harvey; Linda Torczon

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 100 KB
• Volume: 28
• Category: Article
• ISSN: 0038-0644
• DOI: 10.1002/(sici)1097-024x(19980410)28:4<425::aid-spe160>3.0.co;2-2

✦ Synopsis

The design and implementation of an interference graph is critical to the performance of a graphcoloring register allocator. The cost of constructing and manipulating the interference graph dominates the overall cost of allocation. The literature on graph-coloring register allocation suggests the use of a bit matrix coupled with lists of edges to represent the graph. [1][2][3] Recently, George and Appel 4 claimed that their tests show better results using a hash table. This paper examines the trade-offs between these two approaches. Our experiments were conducted with an optimistic, Chaitin-style register allocator. 5 We believe, however, that the lessons learned in the experiment are applicable to any program that needs to build and manipulate large graphs. For most graphs, we obtained our best results, in terms of both time and space, using a modification of the data structures suggested by both Chaitin and Briggs that we call the split bit-matrix method. On a few large graphs, we found that a closed hash-table with the universal hash function suggested by Cormen et al. 6 ran faster than the split bit-matrix method. We found one case where it used less space. This suggests that the split bit-matrix technique should be the method of choice, unless the compiler regularly encounters large interference graphs. In that case, the best strategy might be to implement both data structures behind a common interface, and switch between them based on graph size.