论文信息 - Interference Graphs of Programs in SSA-form

Interference Graphs of Programs in SSA-form

Register allocation is the task of mapping the variables in a program to processor registers. This problem is often reduced to coloring the so-called interference graph which the compiler computes from the input program. Theoretically, for each undirected graph there is a program having that graph as its interference graph. In this paper, we show that interference graphs of programs in SSA-form are chordal.

Sebastian Hack | Interner Bericht | Sebastian Hack | I. Bericht

[1] John Cocke,et al. Register Allocation Via Coloring , 1981, Comput. Lang..

[2] Ken Kennedy,et al. Fast copy coalescing and live-range identification , 2002, PLDI '02.

[3] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[4] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[5] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[6] Robert E. Tarjan,et al. A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[7] Ravi Sethi,et al. Complete register allocation problems , 1973, SIAM J. Comput..

[8] Christian Andersson. Register Allocation by Optimal Graph Coloring , 2003, CC.