Abstract
A significant source for enhancing application performance and for reducing power consumption in embedded processor applications is to improve the usage of the memory hierarchy. Such objective classically translates into optimizing spatial and temporal data locality especially for nested loops. In this paper, we focus on temporal data locality. Unlike many existing methods, our approach pays special attention to TLB (Translation Lookaside Buffer) effectiveness since a TLB miss can take up to three times more cycles than a cache miss. We propose a generalization of the traditional approach for temporal locality improvement, called data sequence localization, which reduces the number of iterations that separates accesses to a given array element.
Chapter PDF
Similar content being viewed by others
Keywords
References
U. Banerjee. Unimodular transformations of double loops. In Advances in Languages and Compilers for Parallel Processing. MIT Press, Cambridge, MA, 1991.
U. Banerjee. Loop Transformations for Restructuring Compilers-The Foundations. Kluwer Academic Publishers, 1993. ISBN 0-7923-9318-X.
M. Cierniak and W. Li. Unifying data and control transformations for distributed shared-memory machines. In Proc. Prog. Lang. Design and Implementation, 1995.
Ph. Clauss. Handling memory cache policy with integer points countings. In Euro-Par’97, pages 285–293, Passau, August 1997. Springer-Verlag, LNCS 1300.
Ph. Clauss and V. Loechner. Parametric analysis of polyhedral iteration spaces. Journal of VLSI Signal Processing, 19(2):179–194, 1998. Kluwer Academic Pub.
Ph. Clauss and B. Meister. Automatic memory layout transformations to optimize spatial locality in parameterized loop nests. ACM SIGARCH Computer Architecture News, 28(1):11–19, March 2000.
C. Ding and K. Kennedy. Improving effective bandwidth through compiler enhancement of global cache reuse. In Proc. of the 2001 International Parallel and Distributed Processing Symposium, San Francisco, April 2001.
P. Feautrier. The Data Parallel Programming Model, volume 1132 of LNCS, chapter Automatic Parallelization in the Polytope Model, pages 79–100. Springer-Verlag, 1996. G.-R. Perrin and A. Darte, Eds. ISBN 3-540-61736-1.
M. Kandemir, A. Choudhary, J. Ramanujam, and P. Banerjee. A matrix-based approach to global locality optimization. Journal of Parallel and Distributed Computing. 58:190–235, 1999.
M. Lam, E. Rothberg, and M. Wolf. The cache performance of blocked algorithms. In Int. Conf. ASPLOS, April 1991.
W. Li. Compiling for NUMA parallel machines. PhD thesis, Dept. Computer Science, Cornell University, Ithaca, NY, 1993.
V. Loechner, B. Meister, and Ph. Clauss. Precise data locality optimization of nested loops. Technical report, ICPS, http://icps.u-strasbg.fr, 2001.
V. Loechner and D. K. Wilde. Parameterized polyhedra and their vertices. International Journal of Parallel Programming, 25(6):525–549, December 1997.
M. O’Boyle and P. Knijnenburg. Nonsingular data transformations: Definition, validity, and applications. Int. J. of Parallel Programming, 27(3):131–1591999.
F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. Int. J. of Parallel Programming, 28(5):469–498, October 2000.
J. M. Rabaey and M. Pedram. Low Power Design Methodologies. Kluwer Academic Publishers, 1995.
A. Schrijver. Theroy of Linear and Integer Programming. John Wiley and Sons, New York, 1986. ISBN 0-471-90854-1.
M. R. Swanson, L. Stoller, and J. Carter. Increasing TLB reach using superpages backed by shadow memory. In Proceedings of the 25th Annual International Symposium on Computer Architecture, pages 204–213, June 1998.
D. K. Wilde. A library for doing polyhedral operations. Master’s thesis, Oregon State University, Corvallis, Oregon, 1993.
M. Wolfe. More iteration space tiling. In Proc. Supercomputing’89, pages 655–664, November 1989.
M. Wolfe. The tiny loop restructuring research tool. In International Conference on Parallel Processing, pages II. 46–53, 1991.
M. Wolfe. High Performance Compilers for Parallel Computing. Addison Wesley, 1996. ISBN 0-8053-2730-4.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loechner, V., Meister, B., Clauss, P. (2001). Data Sequence Locality: A Generalization of Temporal Locality. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_38
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive