# To Update or Not To Update?: Bandwidth-Efficient Intelligent Replacement   Policies for DRAM Caches

**Authors:** Vinson Young, Moinuddin K. Qureshi

arXiv: 1907.02167 · 2019-07-05

## TL;DR

This paper introduces a bandwidth-efficient, stateful replacement policy for DRAM caches that significantly improves hit-rates by tracking reuse with minimal bandwidth overhead.

## Contribution

It proposes RRIP-AOB and ETR, novel techniques that enable effective, bandwidth-efficient replacement policies for gigascale DRAM caches.

## Key findings

- Achieves 18% speedup in DRAM cache performance
- Reduces bandwidth for state tracking by 70%
- Uses less than 1KB SRAM for implementation

## Abstract

This paper investigates intelligent replacement policies for improving the hit-rate of gigascale DRAM caches. Cache replacement policies are commonly used to improve the hit-rate of on-chip caches. The most effective replacement policies often require the cache to track per-line reuse state to inform their decision. A fundamental challenge on DRAM caches, however, is that stateful policies would require significant bandwidth to maintain per-line DRAM cache state. As such, DRAM cache replacement policies have primarily been stateless policies, such as always-install or probabilistic bypass. Unfortunately, we find that stateless policies are often too coarse-grain and become ineffective at the size and associativity of DRAM caches. Ideally, we want a replacement policy that can obtain the hit-rate benefits of stateful replacement policies, but keep the bandwidth-efficiency of stateless policies.   In our study, we find that tracking per-line reuse state can enable an effective replacement policy that can mitigate common thrashing patterns seen in gigascale caches. We propose a stateful replacement/bypass policy called RRIP Age-On-Bypass (RRIP-AOB), that tracks reuse state for high-reuse lines, protects such lines by bypassing other lines, and Ages the state On cache Bypass. Unfortunately, such a stateful technique requires significant bandwidth to update state. To this end, we propose Efficient Tracking of Reuse (ETR). ETR makes state tracking efficient by accurately tracking the state of only one line from a region, and using the state of that line to guide the replacement decisions for other lines in that region. ETR reduces the bandwidth for tracking replacement state by 70%, and makes stateful policies practical for DRAM caches. Our evaluations with a 2GB DRAM cache, show that our RRIP-AOB and ETR techniques provide 18% speedup while needing less than 1KB of SRAM.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1907.02167/full.md

## Figures

23 figures with captions in the complete paper: https://tomesphere.com/paper/1907.02167/full.md

## References

57 references — full list in the complete paper: https://tomesphere.com/paper/1907.02167/full.md

---
Source: https://tomesphere.com/paper/1907.02167