A loop transformation algorithm based on explicit data layout representation for optimizing locality

Mahmut Kandemir, J. Ramanujam, A. Choudhary, P. Banerjee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

We present a cache locality optimization technique that can optimize a loop nest even if the arrays referenced have different layouts in memory. Such a capability is required for a global locality optimization framework that applies both loop and data transformations to a sequence of loop nests for optimizingl ocality. Our method finds a nonsingular iteration-space transformation matrix such that in a given loop nest spatial locality is exploited in the innermost loops where it is most useful. The method builds inverse of a non-singular transformation matrix column-by-column startingfrom the rightmost column. In addition, our approach can work in those cases where the data layouts of a subset of the referenced arrays is unknown. Experimental results on an 8-processor SGI Origin 2000 show that our technique reduces execution times by up to 72%.

Original languageEnglish (US)
Title of host publicationLanguages and Compilers for Parallel Computing - 11th International Workshop, LCPC 1998, Proceedings
EditorsZhiyuan Li, David Sehr, Siddhartha Chatterjee, Jan F. Prins, Larry Carter, Jeanne Ferrante, Pen-Chung Yew
PublisherSpringer Verlag
Pages34-50
Number of pages17
ISBN (Print)3540664262, 9783540664260
StatePublished - Jan 1 1999
Event11th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1998 - Chapel Hill, United States
Duration: Aug 7 1998Aug 9 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1656
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1998
CountryUnited States
CityChapel Hill
Period8/7/988/9/98

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kandemir, M., Ramanujam, J., Choudhary, A., & Banerjee, P. (1999). A loop transformation algorithm based on explicit data layout representation for optimizing locality. In Z. Li, D. Sehr, S. Chatterjee, J. F. Prins, L. Carter, J. Ferrante, & P-C. Yew (Eds.), Languages and Compilers for Parallel Computing - 11th International Workshop, LCPC 1998, Proceedings (pp. 34-50). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1656). Springer Verlag.