The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
A case for exploiting subarray-level parallelism (SALP) in DRAM
Open accessAbstract
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
Cites
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
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
Architecting phase change memory as a scalable dram alternative
Lee, B. C., İpek, E., Mutlu, O., & Burger, D. (2009) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/1555754.1555758 · Cited by 1,494
Self-citationDRAMSim2: 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
An Efficient Algorithm for Exploiting Multiple Arithmetic Units
Tomasulo, R. M. (1967) · IBM Journal of Research and Development · doi:10.1147/rd.111.0025 · Cited by 898
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
Runahead execution: an alternative to very large instruction windows for out-of-order processors
Mutlu, O., Stark, J., Wilkerson, C., & Patt, Y. N. (2003) · The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. · doi:10.1109/hpca.2003.1183532 · Cited by 440
Self-citationATLAS: 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-citationThread Cluster Memory Scheduling: Exploiting Differences in Memory Access Behavior
Kim, Y., Papamichael, M., Mutlu, O., & Harchol-Balter, M. (2010) · 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2010.51 · Cited by 408
Self-citationSelf-Optimizing Memory Controllers: A Reinforcement Learning Approach
Ipek, E., Mutlu, O., Martínez, J. F., & Caruana, R. (2008) · ACM SIGARCH Computer Architecture News · doi:10.1145/1394608.1382172 · Cited by 362
Self-citationParallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems
Mutlu, O., & Moscibroda, T. (2008) · 2008 International Symposium on Computer Architecture · doi:10.1109/isca.2008.7 · Cited by 345
Self-citationStall-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-citationSelf-Optimizing Memory Controllers: A Reinforcement Learning Approach
Ipek, E., Mutlu, O., Martínez, J. F., & Caruana, R. (2008) · 2008 International Symposium on Computer Architecture · doi:10.1109/isca.2008.21 · Cited by 278
Self-citationUnderstanding the Energy Consumption of Dynamic Random Access Memories
Vogelsang, T. (2010) · 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2010.42 · Cited by 257
Rethinking DRAM design and organization for energy-constrained multi-cores
Udipi, A. N., Muralimanohar, N., Chatterjee, N., Balasubramonian, R., Davis, A., & Jouppi, N. P. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1815983 · Cited by 241
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
Microarchitecture Optimizations for Exploiting Memory-Level Parallelism
Chou, Y., Fahs, B. M., & Abraham, S. G. (2004) · ACM SIGARCH Computer Architecture News · doi:10.1145/1028176.1006708 · Cited by 205
A pipelined, shared resource MIMD computer
Smith, B. J. (1986) · IEEE Computer Society Press eBooks · Cited by 203
Micro-pages: increasing DRAM efficiency with locality-aware data placement
Sudan, K., Chatterjee, N., Nellans, D. W., Awasthi, M., Balasubramonian, R., & Davis, A. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1735970.1736045 · Cited by 139
DRAM Circuit Design: Fundamental and High-Speed Topics
Keeth, B., Baker, R. J., Johnson, B., & Lin, F. (2007) · Cited by 118
Staged Reads: Mitigating the impact of DRAM writes on DRAM reads
Chatterjee, N., Muralimanohar, N., Balasubramonian, R., Davis, A., & Jouppi, N. P. (2012) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2012.6168943 · Cited by 68
Improving System Energy Efficiency with Memory Rank Subsetting
Ahn, J. H., Jouppi, N. P., Kozyrakis, C., Leverich, J., & Schreiber, R. (2012) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2133382.2133386 · Cited by 39
2016 Symposium on VLSI Circuits
(2016) · Journal of Microelectromechanical Systems · doi:10.1109/jmems.2016.2518365 · Cited by 17
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-citationRowClone: fast and energy-efficient in-DRAM bulk data copy and initialization
Seshadri, V., Kim, Y., Fallin, C., Lee, D., Ausavarungnirun, R., Pekhimenko, G., Luo, Y., Mutlu, O., Gibbons, P. B., Kozuch, M. A., et al. (2013) · Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/2540708.2540725 · Cited by 337
Self-citationDRISA: a DRAM-based Reconfigurable In-Situ Accelerator
Li, S., Niu, D., Malladi, K. T., Zheng, H., Brennan, B., & Xie, Y. (2017) · Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3123939.3123977 · Cited by 326
Metadata
- Authors
- Kim, Y., Seshadri, V., Lee, D., Liu, J., & Mutlu, O.
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 2012-09-05
- Volume
- 40
- Issue
- 3
- Pages
- 368-379
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W2129991978
- Cited by
- 259
- References
- 24
- FWCI
- 29.92
- Type
- journal article
- Language
- en
- Open access
- green
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.