The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Tiered-latency DRAM: A low latency and low cost DRAM architecture
Open accessAbstract
The capacity and cost-per-bit of DRAM have historically scaled to satisfy the needs of increasingly large and complex computer systems. However, DRAM latency has remained almost constant, making memory latency the performance bottleneck in today's systems. We observe that the high access latency is not intrinsic to DRAM, but a trade-off made to decrease cost-per-bit. To mitigate the high area overhead of DRAM sensing structures, commodity DRAMs connect many DRAM cells to each sense-amplifier through a wire called a bitline. These bitlines have a high parasitic capacitance due to their long length, and this bitline capacitance is the dominant source of DRAM latency. Specialized low-latency DRAMs use shorter bitlines with fewer cells, but have a higher cost-per-bit due to greater sense-amplifier area overhead. In this work, we introduce Tiered-Latency DRAM (TL-DRAM), which achieves both low latency and low cost-per-bit. In TL-DRAM, each long bitline is split into two shorter segments by an isolation transistor, allowing one segment to be accessed with the latency of a short-bitline DRAM without incurring high cost-per-bit. We propose mechanisms that use the low-latency segment as a hardware-managed or software-managed cache. Evaluations show that our proposed mechanisms improve both performance and energy-efficiency for both single-core and multi-programmed workloads.
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
Hitting the memory wall: implications of the obvious
Wulf, W. A., & McKee, S. A. (1995) · ACM SIGARCH Computer Architecture News · doi:10.1145/216585.216588 · Cited by 1,624
Hitting the Memory Wall: Implications of the Obvious
Wulf, W. A., & McKee, S. A. (1995) · Cited by 1,379
Qureshi, M., & Patt, Y. (2006) · 2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06) · doi:10.1109/micro.2006.49 · Cited by 1,094
Borkar, S., & Chien, A. A. (2011) · Communications of the ACM · doi:10.1145/1941487.1941507 · Cited by 966
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
High performance cache replacement using re-reference interval prediction (RRIP)
Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1815971 · Cited by 641
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
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-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-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-citationA case for exploiting subarray-level parallelism (SALP) in DRAM
Kim, Y., Seshadri, V., Lee, D., Liu, J., & Mutlu, O. (2012) · ACM SIGARCH Computer Architecture News · doi:10.1145/2366231.2337202 · Cited by 259
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
Patterson, D. A. (2004) · Communications of the ACM · doi:10.1145/1022594.1022596 · Cited by 238
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
A case for exploiting subarray-level parallelism (SALP) in DRAM
Kim, Y., Seshadri, V., Lee, D., Liu, J., & Mutlu, O. (2012) · 2012 39th Annual International Symposium on Computer Architecture (ISCA) · doi:10.1109/isca.2012.6237032 · Cited by 220
Self-citationMicro-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
Agnello, P. D., Ivers, T., Warm, C., Wise, R. S., Wachnik, R. A., Schepis, D. J., Sankaran, S., Norum, J. P., Luning, S., Li, Y., et al. (2006) · Technical digest - International Electron Devices Meeting/Technical digest · doi:10.1109/iedm.2006.346879 · Cited by 115
The memory gap and the future of high performance memories
Wilkes, M. V. (2001) · ACM SIGARCH Computer Architecture News · doi:10.1145/373574.373576 · Cited by 106
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
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-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-citation
Metadata
- Authors
- Lee, D., Kim, Y., Seshadri, V., Liu, J., Subramanian, L., & Mutlu, O.
- Venue
- 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA)
- Publisher
- IEEE
- Published
- 2013-02
- Pages
- 615-626
- ISSN
- 1530-0897 (ISSN-L)
- OpenAlex
- W2158620667
- Cited by
- 263
- References
- 24
- FWCI
- 16.61
- Type
- conference paper
- 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.