Circular-arc Graph Coloring and Unrolling
Christine Eisenbeis, Sylvain Lelait, Bruno Marmol · 1998
: The register periodic allocation problem is viewed as unrolling and coloring the underlying structure of circular-arc graph. The problem is to find relations between the unrolling degree and the chromatic number. For this purpose we distinguish cyclic colorings that can be found by means of the meeting graph and non-cyclic ones for which we prove the asymptotic property: let r be the width of the original interval family. Then the u-unrolled graph is r or r + 1-colorable for u large enough. Key-words: register allocation, loop unrolling, cyclic coloring, acyclic coloring, circulararc graph (R'esum'e : tsvp) This work was partially supported by a Lise-Meitner Stipendium from the Austrian Science Fund (Fonds zur Forderung der wissenschaftlichen Forschung). [email protected] y Institut fur Computersprachen, Technische Universitat Wien, Argentinierstraße 8, A-1040 Wien, Austria. E-mail : [email protected] z INRIA Rhone-Alpes, 355 Avenue de l'Europe, ZIRST,...