A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Matrix-Based Approach to Global Locality Optimization
1999
Journal of Parallel and Distributed Computing
Global locality optimization is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout transformations. Pure loop transformations are restricted by data dependences and may not be very successful in optimizing imperfectly nested loops and explicitly parallelized programs. Although pure data transformations are not constrained by data dependences, the impact of a data transformation on an array might be program-wide; that is, it
doi:10.1006/jpdc.1999.1552
fatcat:kuchv6xffvbw3g5uzqw6wu56qu