The DOI matches its Crossref record.
A case for exploiting subarray-level parallelism (SALP) in DRAM
Abstract
Modern DRAMs have multiple banks to serve multiple memory requests in parallel. However, when two requests go to the same bank, they have to be served serially, exacerbating the high latency of off-chip memory. Adding more banks to the system to mitigate this problem incurs high system cost. Our goal in this work is to achieve the benefits of increasing the number of banks with a low cost approach. To this end, we propose three new mechanisms that overlap the latencies of different requests that go to the same bank. The key observation exploited by our mechanisms is that a modern DRAM bank is implemented as a collection of subarrays that operate largely independently while sharing few global peripheral structures. Our proposed mechanisms (SALP-1, SALP-2, and MASA) mitigate the negative impact of bank serialization by overlapping different components of the bank access latencies of multiple requests that go to different subarrays within the same bank. SALP-1 requires no changes to the existing DRAM structure and only needs reinterpretation of some DRAM timing parameters. SALP-2 and MASA require only modest changes (<;0.15% area overhead) to the DRAM peripheral structures, which are much less design constrained than the DRAM core. Evaluations show that all our schemes significantly improve performance for both single-core systems and multi-core systems. Our schemes also interact positively with application-aware memory request scheduling in multi-core systems.
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
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-citationFlipping 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) · 2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA) · doi:10.1109/isca.2014.6853210 · Cited by 465
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-citationTiered-latency DRAM: A low latency and low cost DRAM architecture
Lee, D., Kim, Y., Seshadri, V., Liu, J., Subramanian, L., & Mutlu, O. (2013) · 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2013.6522354 · Cited by 263
Self-citationMemory scaling: A systems architecture perspective
Mutlu, O. (2013) · 2013 5th IEEE International Memory Workshop · doi:10.1109/imw.2013.6582088 · Cited by 256
Self-citationA survey on optimization techniques for edge artificial intelligence (ai)
Surianarayanan, C., Lawrence, J. J., Chelliah, P. R., Prakash, E., & Hewage, C. (2023) · Sensors · doi:10.3390/s23031279 · Cited by 131
Towards Energy-Efficient and Secure Edge AI: A Cross-Layer Framework ICCAD Special Session Paper
Shafique, M., Marchisio, A., Wicaksana Putra, R. V., & Hanif, M. A. (2021) · 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD) · doi:10.1109/iccad51958.2021.9643539 · Cited by 58
Metadata
- Authors
- Kim, Y., Seshadri, V., Lee, D., Liu, J., & Mutlu, O.
- Venue
- 2012 39th Annual International Symposium on Computer Architecture (ISCA)
- Publisher
- IEEE
- Published
- 2012-06
- Pages
- 368-379
- ISSN
- 1063-6897 (ISSN-L)
- OpenAlex
- W3147974890
- Cited by
- 220
- References
- 0
- FWCI
- 9.57
- Type
- conference paper
- 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.