Cited by 168Advanced Memory and Neural ComputingParallel Computing and Optimization TechniquesLow-power high-performance VLSI design

15.1 A Programmable Neural-Network Inference Accelerator Based on Scalable In-Memory Computing

Jia, Hongyang, Ozatay, Murat, Tang, Yinqi, Valavi, Hossein, Pathak, Rakshit, Lee, Jinseok, Verma, Naveen·2021·2021 IEEE International Solid- State Circuits Conference (ISSCC)

Abstract

This paper presents a scalable neural-network (NN) inference accelerator in 16nm, based on an array of programmable cores employing mixed-signal In-Memory Computing (IMC), digital Near-Memory Computing (NMC), and localized buffering/control. IMC achieves high energy efficiency and throughput for matrix-vector multiplications (MVMs), which dominate NNs; but, scalability poses numerous challenges, both technologically, going to advanced nodes to maintain gains over digital architectures, and architecturally, for full execution of diverse NNs. Recent demonstrations have explored integrating IMC in programmable processors [1, 2], but have not achieved IMC efficiency and throughput for full executions. The central challenge is drastically different physical design points and associated tradeoffs incurred by IMC compared to digital engines. Namely, IMC substantially increases compute energy efficiency and HW density/parallelism, but retains the overheads of HW virtualization (state and data swapping/buffering/communication across spatial/temporal computation mappings). The demonstrated architecture is co-designed with SW-mapping algorithms (encapsulated in a custom graph compiler), to provide efficiency across a broad range of mapping strategies, to overcome these overheads.

Integrity signals

Registry

Crossref · 10.1109/isscc42613.2021.9365788

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Most compute-in-memory or near-memory approaches based on SRAMs and digital compute do not address the energy and time costs of reloading weights, making direct side-by-side comparisons against NVM-based weight-stationary approaches difficult; several NVM compute-in-memory studies have focused on the macro-level without accounting for data transport, control or chip infrastructure costs, and are,

    “Although several compute-in-memory or near-memory approaches based on SRAMs and digital compute35–38 have been presented in the literature, most of these do not address the energy and time costs of reloading weights, thus making direct side-by-side comparisons against NVM-based weight-stationary approaches difficult.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Jia, H., Ozatay, M., Tang, Y., Valavi, H., Pathak, R., Lee, J., & Verma, N.
Affiliations
Princeton University (US)
Venue
2021 IEEE International Solid- State Circuits Conference (ISSCC)
Publisher
IEEE
Published
2021-02-13
Pages
236-238
ISSN
0193-6530 (ISSN-L)
OpenAlex
W3135835558
Cited by
168
References
10
Citations by year
2026: 11 · 2025: 28 · 2024: 30 · 2023: 45 · 2022: 43 · 2021: 11
FWCI
50.63
Type
conference paper
Language
en
Open access
closed
Locations
Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference (publishedVersion)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Low-power high-performance VLSI design
Keywords
in-memory computing, near-memory computing, matrix-vector multiplication, energy efficiency, scalable hardware architecture

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