The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (1998)
Paris, France
Oct. 12, 1998 to Oct. 18, 1998
ISSN: 1089-795X
ISBN: 0-8186-8591-3
pp: 314
ABSTRACT
Loop transformation techniques have matured to the point where the techniques are well integrated into production optimizing compilers~\cite{kaixpert:97}. However, we believe that new and aggressive techniques are necessary because: computer system manufacturers have announced their plans for forthcoming processors with over 1GHz clock frequency, wherein the miss penalties can be very high, and transformation techniques have saturated in that they have delivered majority of the benefit that can be obtained with perfectly nested loops. The new techniques must target improvement of coverage, that is the classes of loops that can be optimized for locality of data access.In this paper, we present a new technique called size-reduction transformation to improve data access locality in a class of non-perfectly nested loops. The new technique is very effective, when existing techniques, namely, linear loop and array transformations, fail to improve locality of reference. Size-reduction transformations are implemented in IBM's Fortran 90 optimizing compiler released recently, and have contributed significantly to the high performance of the compiler.
INDEX TERMS
Optimizing Compiler, Performance, Locality of reference, Loop and Data Transformations, Size-reduction Transformations
CITATION
Dattatraya Kulkarni, "Transformations for Improving Data Access Locality in Non-Perfectly Nested Loops", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 314, 1998, doi:10.1109/PACT.1998.727267
91 ms
(Ver 3.3 (11022016))