On a graph-theoretical model for cyclic register allocation

D. de Werra, Ch. Eisenbeis, S. Lelait, B. Marmol
1999 Discrete Applied Mathematics  
In the process of compiling a computer programme, we consider the problem of allocating variables to registers within a loop. It can be formulated as a coloring problem in a circular arc graph (intersection graph of a family F of intervals on a circle). We consider the meeting graph of F introduced by Eisenbeis, Lelait and Marmol. Proceedings of the Fifth Workshop on Compilers for Parallel Computers, Malaga, June 1995, pp. 502-515. Characterizations of meeting graphs are developed and their
more » ... c properties are derived with graph theoretical arguments. Furthermore some properties of the chromatic number for periodic circular arc graphs are derived. ? Werra) 0166-218X/99/$ -see front matter ? 1999 Elsevier Science B.V. All rights reserved. PII: S 0 1 6 6 -2 1 8 X ( 9 9 ) 0 0 1 0 5 -5
doi:10.1016/s0166-218x(99)00105-5 fatcat:brjytyh6frcffgd6dwxjh2potu