Abstract
We show that cyclic graph coloring techniques from loop register allocation are successfully applicable to caches. Values of one color belong together, even if they stem from different data structures, resulting in a sytematic merging.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D.F. Bacon, S.L. Graham, and O.J. Sharp. Compiler transformations for highperformance computing. ACM Computing Surveys, 26(4):345–420, December 1994.
Christine Eisenbeis, Sylvain Lelait, and Bruno Marmol. The meeting graph: A new model for loop cyclic register allocation. In Proc. PACT’95, pages 264–267, Limassol, Cyprus, June 27-29, 1995. ACM Press.
M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM J. Alg. Disc. Meth., 1(2):216–227, 1980.
D. Genius and S. Lelait. Improving Data Layout through Coloring-Directed Array Merging. Technical Report 1999-3, Universität Karlsruhe, Januar 1999.
Daniela Genius. Handling Cross Interferences by Cyclic Cache Line Coloring. In Proc. PACT’98, pages 112–117, Paris, France, October 1998. IEEE.
L. Hendren, G. Gao, E. Altman, and C. Mukerji. A register allocation framework based on hierarchical cyclic interval graphs. In Proc. 4th CC, pages 176–191, 1992.
R.A. Huff. Lifetime-Sensitive Modulo Scheduling. SIGPLAN Notices, 28(6), 1993.
Jai Rawat. Static analysis of cache performance for real-time programming. Technical Report IASTATECS//TR93-19, Iowa state university, Nov 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genius, D., Lelait, S. (1999). Compiler-Directed Reordering of Data by Cyclic Graph Coloring. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_179
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_179
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive