mlsanityData to 7 Oct 2026

WWW: What, When, Where to Compute-in-Memory

arXiv 2312.15896 ↗First posted 26 Dec 2023cs.AR cs.DC cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Matrix multiplication is the dominant computation during Machine Learning (ML) inference. To efficiently perform such multiplication operations, Compute-in-memory (CiM) paradigms have emerged as a highly energy efficient solution. However, integrating compute in memory poses key questions, such as 1) What type of CiM to use: Given a multitude of CiM design characteristics, determining their suitability from architecture perspective is needed. 2) When to use CiM: ML inference includes workloads with a variety of memory and compute requirements, making it difficult to identify when CiM is more beneficial than standard processing cores. 3) Where to integrate CiM: Each memory level has different bandwidth and capacity, creating different data reuse opportunities for CiM integration. To answer such questions regarding on-chip CiM integration for accelerating ML workloads, we use an analytical architecture-evaluation methodology with tailored mapping algorithm. The mapping algorithm aims to achieve highest weight reuse and reduced data movements for a given CiM prototype and workload. Our analysis considers the integration of CiM prototypes into the cache levels of a tensor-core-like architecture, and shows that CiM integrated memory improves energy efficiency by up to 3.4x and throughput by up to 15.6x compared to established baseline with INT-8 precision. We believe the proposed work provides insights into what type of CiM to use, and when and where to optimally integrate it in the cache hierarchy for efficient matrix multiplication.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 14 of its 48 references that are in the map. First posted on arXiv 26 Dec 2023.

Builds on

14 of 48 references.

References · 14

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  4. 2019Data-Free Quantization Through Weight Equalization and Bias Correctioncited by 328
  5. 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
  6. 2014cuDNN: Efficient Primitives for Deep Learningcited by 240
  7. 2017SCNN: An Accelerator for Compressed-sparse Convolutional Neural Networkscited by 132
  8. 2023Full Stack Optimization of Transformer Inference: a Surveycited by 79
  9. 2019PUMA: A Programmable Ultra-efficient Memristor-based Accelerator for Machine Learning Inferencecited by 57
  10. 2020A Modern Primer on Processing in Memorycited by 30
  11. 2020ZigZag: A Memory-Centric Rapid DNN Accelerator Design Space Exploration Frameworkcited by 6
  12. 2021IMPULSE: A 65nm Digital Compute-in-Memory Macro with Fused Weights and Membrane Potential for Spike-based Sequential Learning Taskscited by 5
2 more
  1. 2020IMAC: In-memory multi-bit Multiplication andACcumulation in 6T SRAM Arraycited by 3
  2. 2023Benchmarking and modeling of analog and digital SRAM in-memory computing architecturescited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.