A quantitative analysis of loop nest locality (1996)
| Venue: | In Seventh International Conference on Architectural Support for Programming Languages and Operating Systems |
| Citations: | 66 - 8 self |
BibTeX
@INPROCEEDINGS{Mckinley96aquantitative,
author = {Kathryn S. Mckinley and Olivier Temam},
title = {A quantitative analysis of loop nest locality},
booktitle = {In Seventh International Conference on Architectural Support for Programming Languages and Operating Systems},
year = {1996},
pages = {94--104},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A Quantitative Analysis of Loop Nest Locality Abstract This paper analyzes and quantifies the locality characteristics of numerical loop nests in cache memories to suggest future directions for architecture and software cache optimizations. The following three observations motivated this study. 1. Since most programs spend the majority of their time in nests, the vast majority of cache optimization techniques target loop nests. However, the locality characteristics that drive these optimizations are often collected across the entire application and not at the nest level. 2. Numerical codes have been studied for so long that a number of popular assertions have emerged on their locality characteristics. 3. Many optimizations are motivated by these assertions without further exploring their accuracy.
