Abstract
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.
| Original language | English |
|---|---|
| Pages | 151-156 |
| Number of pages | 6 |
| Publication status | Published - 1997 |
| Event | Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97 - Seoul, South Korea Duration: 1997 Apr 28 → 1997 May 2 |
Other
| Other | Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97 |
|---|---|
| City | Seoul, South Korea |
| Period | 97/4/28 → 97/5/2 |
ASJC Scopus subject areas
- General Computer Science