HAPPY: Hybrid Address-based Page Policy in DRAMs
Mohsen Ghasempour, Aamer Jaleel, Jim Garside, and Mikel Luj\'an

TL;DR
HAPPY introduces a compact address-based encoding technique to enhance hybrid DRAM page policies, significantly reducing hardware overhead while maintaining prediction accuracy across various workloads.
Contribution
The paper proposes a novel address encoding method, HAPPY, that improves or maintains DRAM page closure prediction performance with lower hardware overhead.
Findings
Reduces hardware overhead by up to 40X for large memory systems.
Maintains prediction accuracy with the new encoding technique.
Effective across diverse memory-intensive workloads.
Abstract
Memory controllers have used static page closure policies to decide whether a row should be left open, open-page policy, or closed immediately, close-page policy, after the row has been accessed. The appropriate choice for a particular access can reduce the average memory latency. However, since application access patterns change at run time, static page policies cannot guarantee to deliver optimum execution time. Hybrid page policies have been investigated as a means of covering these dynamic scenarios and are now implemented in state-of-the-art processors. Hybrid page policies switch between open-page and close-page policies while the application is running, by monitoring the access pattern of row hits/conflicts and predicting future behavior. Unfortunately, as the size of DRAM memory increases, fine-grain tracking and analysis of memory access patterns does not remain practical. We…
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.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Advanced Data Storage Technologies · Security and Verification in Computing
