How to Kill the Second Bird with One ECC: The Pursuit of Row Hammer Resilient DRAM
Open Access
- 28 October 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 986-1001
Abstract
Error-correcting code (ECC) has been widely used in DRAM-based memory systems to address the exacerbating random errors following the fabrication process scaling. However, ECCs including the strong form of Chipkill have not been so effective against Row Hammer (RH), which incurs bursts of errors discretely corrupting the whole row beyond the ECC correction capability. We propose Cube, a novel chip-wise physical to DRAM address randomization scheme that leverages the abundant detection capability of on-die-ECC (OECC) and correction capability of Chipkill against RH. Cube allows for synergistic cooperation between ECC, probabilistic RH-protection schemes, and the system with minimal to no modification for each. First, Cube scrambles the rows of each chip using a boot-time key in a way that distributes RH victims to multiple Chipkill codewords. Second, Cube utilizes the newly observed distinct RH error characteristics from real DRAM chips, to swiftly diagnose the RH victim rows using the error profile from OECC scrubbing, and even correct it leveraging Chipkill. When combined, Cube decreases the failure probability of PARA and a state-of-the-art RH protection scheme SRS by up to 10− 25. At a target failure probability of 10− 10 per year on a DDR5 rank under the RH threshold of 2K, Cube reduces the performance and table size overhead of SRS by up to 24.3% and 39.9%, respectively.Keywords
Funding Information
- Institute of Information & Communications Technology Planning & Evaluation (2021-0-00863)
This publication has 86 references indexed in Scilit:
- Architectural Support for Mitigating Row Hammering in DRAM MemoriesIEEE Computer Architecture Letters, 2014
- How to Encipher Messages on a Small Domain2009
- Security of Random Feistel Schemes with 5 or More Rounds2004
- The Security of Many-Round Luby-Rackoff Pseudo-Random PermutationsLecture Notes in Computer Science, 2003
- Automatically characterizing large scale program behaviorACM SIGPLAN Notices, 2002
- Ciphers with Arbitrary Finite Domains2002
- Foiling Birthday Attacks in Length-Doubling Transformations1996
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- Finding repeated elementsScience of Computer Programming, 1982
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970