The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
NDA: Near-DRAM acceleration architecture leveraging commodity DRAM devices and standard memory modules
Abstract
Energy consumed for transferring data across the processor memory hierarchy constitutes a large fraction of total system energy consumption, and this fraction has steadily increased with technology scaling. In this paper, we propose near-DRAM acceleration (NDA) architectures, which process data using accelerators 3D-stacked on DRAM devices comprising off-chip main memory modules. NDA transfers most data through high-bandwidth and low-energy 3D interconnects between accelerators and DRAM devices instead of low-bandwidth and high-energy off-chip interconnects between a processor and DRAM devices, substantially reducing energy consumption and improving performance. Unlike previous near-memory processing architectures, NDA is built upon commodity DRAM devices; apart from inserting through-silicon vias (TSVs) to 3D-interconnect DRAM devices and accelerators, NDA requires minimal changes to the commodity DRAM device and standard memory module architectures. This allows NDA to be more easily adopted in both existing and emerging systems. Our experiments demonstrate that, on average, our NDA-based system consumes 46% (68%) lower (data transfer) energy at 1.67× higher performance than a system that integrates the same accelerator logic within the processor itself.
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
Binkert, N., Beckmann, B., Black, G., Reinhardt, S. K., Saidi, A., Basu, A., Hestness, J., Hower, D. R., Krishna, T., Sardashti, S., et al. (2011) · ACM SIGARCH Computer Architecture News · doi:10.1145/2024716.2024718 · Cited by 4,930 · cited 1×
“4 Simulation Platform We extended the gem5 simulator [57] with the ARM ISA to support CGRA execution, 3D-stacked memory, and nontemporal memory accesses.”
MethodThe SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.223990 · Cited by 3,624
Rodinia: A benchmark suite for heterogeneous computing
Che, S., Boyer, M., Meng, J., Tarjan, D., Sheaffer, J. W., Lee, S.-H., & Skadron, K. (2009) · 2009 IEEE International Symposium on Workload Characterization (IISWC) · doi:10.1109/iiswc.2009.5306797 · Cited by 3,018
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (2002) · Proceedings 22nd Annual International Symposium on Computer Architecture · doi:10.1109/isca.1995.524546 · Cited by 1,601
Reconfigurable computing: a survey of systems and software
Compton, K., & Hauck, S. (2002) · ACM Computing Surveys · doi:10.1145/508352.508353 · Cited by 1,240
Garp: a MIPS processor with a reconfigurable coprocessor
Hauser, J. R., & Wawrzynek, J. (2002) · Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186) · doi:10.1109/fpga.1997.624600 · Cited by 792
Parboil: A Revised Benchmark Suite for Scientific and Commercial Throughput Computing
Stratton, J. A., Rodrigues, C. I., Sung, I.-J., Obeid, N., Chang, L., Anssari, N., Liu, G. D., & Hwu, W. (2012) · Cited by 707
Patterson, D., Anderson, T., Cardwell, N., Fromm, R., Keeton, K., Kozyrakis, C., Thomas, R., & Yelick, K. (1997) · IEEE Micro · doi:10.1109/40.592312 · Cited by 665
GPUs and the Future of Parallel Computing
Keckler, S. W., Dally, W. J., Khailany, B., Garland, M., & Glasco, D. (2011) · IEEE Micro · doi:10.1109/mm.2011.89 · Cited by 658
ADRES: An Architecture with Tightly Coupled VLIW Processor and Coarse-Grained Reconfigurable Matrix
Mei, B., Vernalde, S., Verkest, D., De Man, H., & Lauwereins, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45234-8_7 · Cited by 558
Cited by
PipeLayer: A Pipelined ReRAM-Based Accelerator for Deep Learning
Song, L., Qian, X., Li, H., & Chen, Y. (2017) · 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2017.55 · Cited by 833
PIM-enabled instructions: a low-overhead, locality-aware processing-in-memory architecture
Ahn, J., Yoo, S., Mutlu, O., & Choi, K. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2750385 · Cited by 436
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
A Survey of Accelerator Architectures for Deep Neural Networks
Chen, Y., Xie, Y., Song, L., Chen, F., & Tang, T. (2020) · Engineering · doi:10.1016/j.eng.2020.01.007 · Cited by 370
Computing in Memory With Spin-Transfer Torque Magnetic RAM
Jain, S., Ranjan, A., Roy, K., & Raghunathan, A. (2018) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2017.2776954 · Cited by 355
DRISA: 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
Breaking the von Neumann bottleneck: architecture-level processing-in-memory technology
Zou, X., Xu, S., Chen, X., Yan, L., & Han, Y. (2021) · Science China Information Sciences · doi:10.1007/s11432-020-3227-1 · Cited by 311
Processing data where it makes sense: Enabling in-memory computation
Mutlu, O., Ghose, S., Gómez-Luna, J., & Ausavarungnirun, R. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.01.009 · Cited by 300
Practical Near-Data Processing for In-Memory Analytics Frameworks
Gao, M., Ayers, G., & Kozyrakis, C. (2015) · 2015 International Conference on Parallel Architecture and Compilation (PACT) · doi:10.1109/pact.2015.22 · Cited by 266
Buddy-RAM: Improving the Performance and Efficiency of Bulk Bitwise Operations Using DRAM
Seshadri, V., Lee, D., Mullins, T., Hassan, H., Boroumand, A., Kim, J., Kozuch, M. A., Mutlu, O., Gibbons, P. B., & Mowry, T. C. (2016) · arXiv · doi:10.48550/arxiv.1611.09988 · Cited by 54
“In fact, many recent works have proposed mechanisms to improve and exploit such architectures (e.g., [11, 12, 23, 25, 74]).”
Background
Metadata
- Authors
- Farmahini-Farahani, A., Ahn, J. H., Morrow, K., & Kim, N. S.
- Venue
- 2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA)
- Publisher
- IEEE
- Published
- 2015-02
- Pages
- 283-295
- ISSN
- 1530-0897 (ISSN-L)
- OpenAlex
- W2045431893
- Cited by
- 274
- References
- 44
- FWCI
- 34.77
- 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.