On a Graph-theoretical Model for Cyclic Register Allocation

@article{Werra1999OnAG,
  title={On a Graph-theoretical Model for Cyclic Register Allocation},
  author={Dominique de Werra and Christine Eisenbeis and Sylvain Lelait and Bruno Marmol},
  journal={Discrete Applied Mathematics},
  year={1999},
  volume={93},
  pages={191-203}
}
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… CONTINUE READING
32 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Contribution a l’allocation de registres dans les boucles

  • S. Lelait
  • Th ese de Doctorat, Universit e d’Orl eans
  • 1996
Highly Influential
10 Excerpts

D

  • J. Blazewicz, A. Hertz, D. Kobler
  • de Werra, On some properties of DNA graphs, ORWP…
  • 1997
1 Excerpt

Graphes

  • C. Berge
  • Gauthier-Villars, Paris
  • 1983
3 Excerpts

Coloring a family of circular arcs

  • A. Tucker
  • SIAM J. Appl. Math. 29
  • 1975
1 Excerpt

Alg ebre moderne et th eorie des graphes orient ees vers les sciences economiques et sociales, tomes

  • B. Roy
  • I et II,
  • 1970
1 Excerpt

Similar Papers

Loading similar papers…