Design Guidelines for High-Performance SCM Hierarchies
Dmitrii Ustiugov, Alexandros Daglis, Javier Picorel, Mark Sutherland,, Edouard Bugnion, Babak Falsafi, Dionisios Pnevmatikatos

TL;DR
This paper explores how integrating a modestly sized 3D stacked DRAM cache with emerging storage-class memory can optimize performance and cost in server memory hierarchies, providing design guidelines and a methodology for deployment.
Contribution
It introduces a methodology for designing SCM-based memory hierarchies with DRAM caches, demonstrating cost-performance trade-offs and concrete configurations using PCM as a case study.
Findings
A 2 bits/cell PCM technology reduces memory cost by 40%.
Performance remains within 3% of DRAM-only systems with the proposed design.
Single-level and triple-level cell PCM are impractical as memory replacements.
Abstract
With emerging storage-class memory (SCM) nearing commercialization, there is evidence that it will deliver the much-anticipated high density and access latencies within only a few factors of DRAM. Nevertheless, the latency-sensitive nature of memory-resident services makes seamless integration of SCM in servers questionable. In this paper, we ask the question of how best to introduce SCM for such servers to improve overall performance/cost over existing DRAM-only architectures. We first show that even with the most optimistic latency projections for SCM, the higher memory access latency results in prohibitive performance degradation. However, we find that deployment of a modestly sized high-bandwidth 3D stacked DRAM cache makes the performance of an SCM-mostly memory system competitive. The high degree of spatial locality that memory-resident services exhibit not only simplifies the…
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.
