DSPatch: Dual Spatial Pattern Prefetcher
Rahul Bera, Anant V. Nori, Onur Mutlu, Sreenivas Subramoney

TL;DR
DSPatch is a dynamic, adaptive prefetcher that uses spatial bit-patterns to improve memory performance by intelligently balancing coverage and accuracy based on bandwidth utilization.
Contribution
It introduces DSPatch, a novel prefetcher that dynamically adjusts prefetching strategies using modulated spatial bit-patterns to optimize performance under varying bandwidth conditions.
Findings
DSPatch improves performance by up to 26% over baseline prefetchers.
Performance gains increase with higher DRAM bandwidth, reaching 10%.
Uses only 3.6KB of storage for effective prefetching.
Abstract
High main memory latency continues to limit performance of modern high-performance out-of-order cores. While DRAM latency has remained nearly the same over many generations, DRAM bandwidth has grown significantly due to higher frequencies, newer architectures (DDR4, LPDDR4, GDDR5) and 3D-stacked memory packaging (HBM). Current state-of-the-art prefetchers do not do well in extracting higher performance when higher DRAM bandwidth is available. Prefetchers need the ability to dynamically adapt to available bandwidth, boosting prefetch count and prefetch coverage when headroom exists and throttling down to achieve high accuracy when the bandwidth utilization is close to peak. To this end, we present the Dual Spatial Pattern Prefetcher (DSPatch) that can be used as a standalone prefetcher or as a lightweight adjunct spatial prefetcher to the state-of-the-art delta-based Signature Pattern…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
