Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (1998)
Oct. 12, 1998 to Oct. 18, 1998
M. Kandemir , Syracuse University
A. Choudhary , Northwestern University
P. Banerjee , Northwestern University
J. Ramanujam , Louisiana State University
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop transformations are restricted by data dependences and may not be very successful in optimizing imperfectly nested loops; the impact of a data transformation on an array might be program-wide. Therefore, in this paper we argue for a combined approach which employs both loop and data transformations. The method enjoys the advantages of the most of the previous techniques for enhancing locality and is efficient. In our approach, the loop nests are processed one by one and the data layout constraints obtained from one nest are propagated for optimization of the remaining loop nests. We show that this process can be put in a simple matrix framework which can be manipulated by an optimizing compiler. The search space that we consider for possible loop transformations comprises general non-singular linear transformation matrices and the data layouts that we consider are those which can be expressed using hyperplanes. Experiments using several programs on an SGI Origin 2000 distributed-shared-memory machine demonstrate the efficacy of our approach.
data layout optimizations, loop transformations, optimizing for locality, global (whole program) optimization, combined unified loop and data transformations.
M. Kandemir, A. Choudhary, P. Banerjee, J. Ramanujam, "A Matrix-Based Approach to the Global Locality Optimization Problem", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 306, 1998, doi:10.1109/PACT.1998.727266