Exploiting Spatial Locality in Data Caches using Spatial Footprints.

Sanjeev Kumar, Christopher Wilkerson.

In the Proceedings of IEEE/ACM International Symposium on Computer Architecture (ISCA), Pages 357-368, Barcelona, Spain, June 1998.

Paper: pdf [0.13MB ], ps [0.32MB ]
Talk: ppt

Modern cache designs exploit spatial locality by fetching large blocks of data called cache lines on a cache miss. Subsequent references to words within the same cache line result in cache hits. Although this approach benefits from spatial locality, less than half of the data brought into the cache gets used before eviction. The unused portion of the cache line negatively impacts performance by wasting bandwidth and polluting the cache by replacing potentially useful data that would otherwise remain in the cache.

This paper describes an alternative approach to exploit spatial locality available in data caches. On a cache miss, our mechanism, called Spatial Footprint Predictor (SFP), predicts which portions of a cache block will get used before getting evicted. The high accuracy of the predictor allows us to exploit spatial locality exhibited in larger blocks of data yielding better miss ratios without significantly impacting the memory access latencies. Our evaluation of this mechanism shows that the miss rate of the cache is improved, on average, by 18 % in addition to a significant reduction in the bandwidth requirement.