Sciweavers

Share
LCPC
1998
Springer

A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality

11 years 3 months ago
A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality
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 optimizing locality. 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 starting from 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%.
Mahmut T. Kandemir, J. Ramanujam, Alok N. Choudhar
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where LCPC
Authors Mahmut T. Kandemir, J. Ramanujam, Alok N. Choudhary, Prithviraj Banerjee
Comments (0)
books