The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
RAIDR: Retention-Aware Intelligent DRAM Refresh
Abstract
Dynamic random-access memory (DRAM) is the building block of modern main memory systems. DRAM cells must be periodically refreshed to prevent loss of data. These refresh operations waste energy and degrade system performance by interfering with memory accesses. The negative effects of DRAM refresh increase as DRAM device capacity increases. Existing DRAM devices refresh all cells at a rate determined by the leakiest cell in the device. However, most DRAM cells can retain data for significantly longer. Therefore, many of these refreshes are unnecessary. In this paper, we propose RAIDR (Retention-Aware Intelligent DRAM Refresh), a low-cost mechanism that can identify and skip unnecessary refreshes using knowledge of cell retention times. Our key idea is to group DRAM rows into retention time bins and apply a different refresh rate to each bin. As a result, rows containing leaky cells are refreshed as frequently as normal, while most rows are refreshed less frequently. RAIDR uses Bloom filters to efficiently implement retention time bins. RAIDR requires no modification to DRAM and minimal modification to the memory controller. In an 8-core system with 32 GB DRAM, RAIDR achieves a 74.6% refresh reduction, an average DRAM power reduction of 16.1%, and an average system performance improvement of 8.6% over existing systems, at a modest storage overhead of 1.25 KB in the memory controller. RAIDR's benefits are robust to variation in DRAM system configuration, and increase as memory capacity increases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065034 · Cited by 3,180
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065034 · Cited by 2,310
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Knuth, D. E. (1998) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,421
DRAMSim2: A Cycle Accurate Memory System Simulator
Rosenfeld, P., Cooper-Balis, E., & Jacob, B. (2011) · IEEE Computer Architecture Letters · doi:10.1109/l-ca.2011.4 · Cited by 908
Die Stacking (3D) Microarchitecture
Black, B., Pantuso, D., Reed, P., Rupley, J., Shankar, S., Shen, J., Webb, C., Annavaram, M., Brekelbaum, N., DeVale, J., et al. (2006) · 2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06) · doi:10.1109/micro.2006.18 · Cited by 603
Symbiotic jobscheduling for a simultaneous mutlithreading processor
Snavely, A., & Tullsen, D. M. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357011 · Cited by 535
Symbiotic jobscheduling for a simultaneous multithreaded processor
Snavely, A., & Tullsen, D. M. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379244 · Cited by 484
Marsaglia, G. (2003) · Journal of Statistical Software · doi:10.18637/jss.v008.i14 · Cited by 434
ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers
Kim, Y., Han, D., Mutlu, O., & Harchol-Balter, M. (2010) · HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture · doi:10.1109/hpca.2010.5416658 · Cited by 430
Self-citationFlikker: saving DRAM refresh-power through critical data partitioning
Liu, S., Pattabiraman, K., Moscibroda, T., & Zorn, B. G. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950391 · Cited by 412
Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors
Mutlu, O., & Moscibroda, T. (2007) · 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007) · doi:10.1109/micro.2007.21 · Cited by 327
Self-citationA Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs
Thies, W., Chandrasekhar, V., & Amarasinghe, S. (2007) · 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007) · doi:10.1109/micro.2007.38 · Cited by 274
On the retention time distribution of dynamic random access memory (DRAM)
Hamamoto, T., Sugiura, S., & Sawada, S. (1998) · IEEE Transactions on Electron Devices · doi:10.1109/16.678551 · Cited by 242
Mini-rank: Adaptive DRAM architecture for improving memory power efficiency
Zheng, H., Lin, J., Zhang, Z., Gorbatov, E., David, H., & Zhu, Z. (2008) · 2008 41st IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2008.4771792 · Cited by 235
Retention-Aware Placement in DRAM (RAPID): Software Methods for Quasi-Non-Volatile DRAM
Venkatesan, R. K., Herr, S., & Rotenberg, E. (2006) · The Twelfth International Symposium on High-Performance Computer Architecture, 2006. · doi:10.1109/hpca.2006.1598122 · Cited by 215
Ghosh, M., & Lee, H.-H. S. (2007) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2007.13 · Cited by 204
Efficient hardware hashing functions for high performance computers
Ramakrishna, M. V., Fu, E., & Bahcekapili, E. (1997) · IEEE Transactions on Computers · doi:10.1109/12.641938 · Cited by 198
Elastic Refresh: Techniques to Mitigate Refresh Penalties in High Density Memory
Stuecheli, J., Kaseridis, D., Hunter, H. C., & John, L. K. (2010) · Proceedings of the ... annual International Symposium on Microarchitecture/Proceedings of the annual International Symposium on Microarchitecture · doi:10.1109/micro.2010.22 · Cited by 123
DRAM Circuit Design: Fundamental and High-Speed Topics
Keeth, B., Baker, R. J., Johnson, B., & Lin, F. (2007) · Cited by 118
Optimizing the DRAM refresh count for merged DRAM/logic LSIs
Ohsawa, T., Kai, K., & Murakami, K. J. (1998) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1145/280756.280792 · Cited by 91
Isen, & John, J. K. (2009) · Cited by 73
Isen, C., & John, L. K. (2009) · Proceedings of the ... annual International Symposium on Microarchitecture/Proceedings of the annual International Symposium on Microarchitecture · doi:10.1145/1669112.1669156 · Cited by 61
Kong, W., Parries, P., Wang, G., & Iyer, S. S. (2008) · Proceedings/Proceedings - International Test Conference · doi:10.1109/test.2008.4700556 · Cited by 32
Energy-Efficient Value-Based Selective Refresh for Embedded DRAMs
Patel, K., Benini, L., Macii, E., & Poncino, M. (2005) · Lecture notes in computer science · doi:10.1007/11556930_48 · Cited by 28
Cited by
Flipping bits in memory without accessing them: an experimental study of DRAM disturbance errors
Kim, Y., Daly, R., Kim, J., Fallin, C., Lee, J. H., Lee, D., Wilkerson, C., Lai, K., & Mutlu, O. (2014) · ACM SIGARCH Computer Architecture News · doi:10.1145/2678373.2665726 · Cited by 921
Self-citationRamulator: A Fast and Extensible DRAM Simulator
Kim, Y., Yang, W., & Mutlu, O. (2016) · IEEE Computer Architecture Letters · doi:10.1109/lca.2015.2414456 · Cited by 764
Self-citationAmbit: in-memory accelerator for bulk bitwise operations using commodity DRAM technology
Seshadri, V., Lee, D., Mullins, T., Hassan, H., Boroumand, A., Kim, J., Kozuch, M. A., Mutlu, O., Gibbons, P. B., & Mowry, T. C. (2017) · Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3123939.3124544 · Cited by 434
Self-citationError Characterization, Mitigation, and Recovery in Flash-Memory-Based Solid-State Drives
Cai, Y., Ghose, S., Haratsch, E. F., Luo, Y., & Mutlu, O. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2713127 · Cited by 343
Self-citationOvercoming the challenges of crossbar resistive memory architectures
Xu, C., Niu, D., Muralimanohar, N., Balasubramonian, R., Zhang, T., Yu, S., & Xie, Y. (2015) · 2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2015.7056056 · Cited by 340
Metadata
- Authors
- Liu, J., Jaiyen, B., Veras, R., & Mutlu, O.
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 2012-09-05
- Volume
- 40
- Issue
- 3
- Pages
- 1-12
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W2119092821
- Cited by
- 444
- References
- 27
- FWCI
- 53.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.