Understanding Why Correlation Profiling Improves the Predictability of Data Cache Misses in Nonnumeric Applications
Issue No. 04 - April (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.844349
<p><b>Abstract</b>— Latency-tolerance techniques offer the potential for bridging the ever-increasing speed gap between the memory subsystem and today's high-performance processors. However, to fully exploit the benefit of these techniques, one must be careful to apply them only to the dynamic references that are likely to suffer cache misses—otherwise the runtime overheads can potentially offset any gains. In this paper, we focus on isolating dynamic miss instances in <it>nonnumeric</it> applications, which is a difficult but important problem. Although compilers cannot statically analyze data locality in nonnumeric applications, one viable approach is to use profiling information to measure the actual miss behavior. Unfortunately, the state-of-the-art in cache miss profiling (which we call <it>summary profiling</it>) is inadequate for references with intermediate miss ratios—it either misses opportunities to hide latency, or else inserts overhead that is unnecessary. To overcome this problem, we propose and evaluate a new profiling technique that helps predict which dynamic instances of a static memory reference will hit or miss in the cache: <it>correlation profiling</it>. Our experimental results demonstrate that roughly half of the 21 nonnumeric applications we study can potentially enjoy significant reductions in memory stall time by exploiting at least one of the three forms of correlation profiling we consider: <it>control-flow correlation</it>, <it>self correlation</it>, and <it>global correlation</it>. In addition, our detailed case studies illustrate that self correlation succeeds because a given reference's cache outcomes often contain repeated patterns and control-flow correlation succeeds because cache outcomes are often call-chain dependent. Finally, we suggest a number of ways to exploit correlation profiling in practice and demonstrate that software prefetching can achieve better performance on a modern superscalar processor when directed by correlation profiling rather than summary profiling information.</p>
Cache performance, cache miss prediction, correlation-based profiling.
Todd C. Mowry, Chi-Keung Luk, "Understanding Why Correlation Profiling Improves the Predictability of Data Cache Misses in Nonnumeric Applications", IEEE Transactions on Computers, vol. 49, no. , pp. 369-384, April 2000, doi:10.1109/12.844349