Enabling Scientific Computing on Memristive Accelerators
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Linear algebra is ubiquitous across virtually every field of science and engineering, from climate modeling to macroeconomics. This ubiquity makes linear algebra a prime candidate for hardware acceleration, which can improve both the run time and the energy efficiency of a wide range of scientific applications. Recent work on memristive hardware accelerators shows significant potential to speed up matrix-vector multiplication (MVM), a critical linear algebra kernel at the heart of neural network inference tasks. Regrettably, the proposed hardware is constrained to a narrow range of workloads: although the eight-to 16-bit computations afforded by memristive MVM accelerators are acceptable for machine learning, they are insufficient for scientific computing where high-precision floating point is the norm. This paper presents the first proposal to enable scientific computing on memristive crossbars. Three techniques are explored — reducing overheads by exploiting exponent range locality, early termination of fixed-point computation, and static operation scheduling — that together enable a fixed-point memristive accelerator to perform high-precision floating point without the exorbitant cost of naïve floating-point emulation on fixed-point hardware. A heterogeneous collection of crossbars with varying sizes is proposed to efficiently handle sparse matrices, and an algorithm for mapping the dense subblocks of a sparse matrix to an appropriate set of crossbars is investigated. The accelerator can be combined with existing GPU-based systems to handle datasets that cannot be efficiently handled by the memristive accelerator alone. The proposed optimizations permit the memristive MVM concept to be applied to a wide range of problem domains, respectively improving the execution time and energy dissipation of sparse linear solvers by 10.3x and 10.9x over a purely GPU-based system.
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
In-Datacenter Performance Analysis of a Tensor Processing Unit
Jouppi, N. P., Young, C., Patil, N., Patterson, D., Agrawal, G., Bajwa, R., Bates, S., Bhatia, S., Boden, N., Borchers, A., et al. (2017) · Proceedings of the 44th Annual International Symposium on Computer Architecture · doi:10.1145/3079856.3080246 · Cited by 4,537 · cited 1×
“The increasing prominence of machine learning workloads in recent years has led to many proposals for dedicated machine learning accelerators, both in academia [16] and industry [17].”
BackgroundThe LINPACK Benchmark: past, present and future
Dongarra, J. J., Luszczek, P., & Petitet, A. (2003) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.728 · Cited by 813
High switching endurance in TaOx memristive devices
Yang, J. J., Zhang, M.-X., Strachan, J. P., Miao, F., Pickett, M. D., Kelley, R. D., Medeiros-Ribeiro, G., & Williams, R. S. (2010) · Applied Physics Letters · doi:10.1063/1.3524521 · Cited by 637
High precision tuning of state for memristive devices by adaptable variation-tolerant algorithm
Alibart, F., Gao, L., Hoskins, B. D., & Strukov, D. B. (2012) · Nanotechnology · doi:10.1088/0957-4484/23/7/075201 · Cited by 557 · cited 1×
“The results show virtually no sensitivity to programming error for single-bit cells until the programming error reaches 5%, well within the achievable programming precision reported in the literature [58].”
BackgroundKull, L., Toifl, T., Schmatz, M., Francese, P. A., Menolfi, C., Brandli, M., Kossel, M., Morf, T., Andersen, T. M., & Leblebici, Y. (2013) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2013.2279571 · Cited by 347
Overcoming 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
Saberi, M., Lotfi, R., Mafinezhad, K., & Serdijn, W. A. (2011) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2011.2107214 · Cited by 236 · cited 2×
“The average power dissipation of the ADC grows exponentially with resolution [34]–[36].”
Background
Cited by
Memory devices and applications for in-memory computing
Sebastian, A., Le Gallo, M., Khaddam-Aljameh, R., & Eleftheriou, E. (2020) · Nature Nanotechnology · doi:10.1038/s41565-020-0655-z · Cited by 2,289
Memristive technologies for data storage, computation, encryption, and radio-frequency communication
Lanza, M., Sebastian, A., Lu, W. D., Le Gallo, M., Chang, M.-F., Akinwande, D., Puglisi, F. M., Alshareef, H. N., Liu, M., & Roldan, J. B. (2022) · Science · doi:10.1126/science.abj9979 · Cited by 708
The physics of optical computing
McMahon, P. L. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00645-5 · Cited by 418
A general memristor-based partial differential equation solver
Zidan, M. A., Jeong, Y., Lee, J., Chen, B., Huang, S., Kushner, M. J., & Lu, W. D. (2018) · Nature Electronics · doi:10.1038/s41928-018-0100-6 · Cited by 261
On the Accuracy of Analog Neural Network Inference Accelerators
Xiao, T. P., Feinberg, B., Bennett, C. H., Prabhakar, V., Saxena, P., Agrawal, V., Agarwal, S., & Marinella, M. J. (2022) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2022.3214409 · Cited by 76
Self-citation
Metadata
- Authors
- Feinberg, B., Vengalam, U. K. R., Whitehair, N., Wang, S., & Ipek, E.
- Venue
- 2018 ACM/IEEE 45th Annual International Symposium on Computer Architecture (ISCA)
- Publisher
- IEEE
- Published
- 2018-06
- Pages
- 367-382
- OpenAlex
- W2883084140
- Cited by
- 109
- References
- 7
- FWCI
- 16.89
- 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.