On the problem of optimizing data transfers for complex memory systems
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Strategies for cache and local memory management by global program transformation
Proceedings of the 1st International Conference on Supercomputing
The cache performance and optimizations of blocked algorithms
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
A data locality optimizing algorithm
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Tile size selection using cache organization and data layout
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
A Loop Transformation Theory and an Algorithm to Maximize Parallelism
IEEE Transactions on Parallel and Distributed Systems
On Estimating and Enhancing Cache Effectiveness
Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing
Hi-index | 0.00 |
We propose reference distance as a metric for data locality. Reference distance is the number of referenced memory blocks between two successive references to the same memory block. Effectiveness of program transformations for data locality can be evaluated by using reference distance. Our claim is demonstrated by showing the change in data locality and speedup of matrix multiplication due to loop interchange, loop tiling, and loop unrolling. We also present a result of an experiment using loop distribution and unrolling with respect to two subroutines of Perfect benchmark programs. Reference distance would serve as a useful tool for developing program transformation scheme for data locality optimization.