mlsanityData to 7 Oct 2026

CIM-MLC: A Multi-level Compilation Stack for Computing-In-Memory Accelerators

arXiv 2401.12428 ↗First posted 23 Jan 2024cs.AR cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

In recent years, various computing-in-memory (CIM) processors have been presented, showing superior performance over traditional architectures. To unleash the potential of various CIM architectures, such as device precision, crossbar size, and crossbar number, it is necessary to develop compilation tools that are fully aware of the CIM architectural details and implementation diversity. However, due to the lack of architectural support in current popular open-source compiling stacks, existing CIM designs either manually deploy networks or build their own compilers, which is time-consuming and labor-intensive. Although some works expose the specific CIM device programming interfaces to compilers, they are often bound to a fixed CIM architecture, lacking the flexibility to support the CIM architectures with different computing granularity. On the other hand, existing compilation works usually consider the scheduling of limited operation types (such as crossbar-bound matrix-vector multiplication). Unlike conventional processors, CIM accelerators are featured by their diverse architecture, circuit, and device, which cannot be simply abstracted by a single level if we seek to fully explore the advantages brought by CIM. Therefore, we propose CIM-MLC, a universal multi-level compilation framework for general CIM architectures. We first establish a general hardware abstraction for CIM architectures and computing modes to represent various CIM accelerators. Based on the proposed abstraction, CIM-MLC can compile tasks onto a wide range of CIM accelerators having different devices, architectures, and programming interfaces. More importantly, compared with existing compilation work, CIM-MLC can explore the mapping and scheduling strategies across multiple architectural tiers, which form a tractable yet effective design space, to achieve better scheduling and instruction generation results.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 12 of its 54 references that are in the map. First posted on arXiv 23 Jan 2024.

Builds on

12 of 54 references.

References · 12

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2018Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractionscited by 84
  5. 2018Glow: Graph Lowering Compiler Techniques for Neural Networkscited by 73
  6. 2019PUMA: A Programmable Ultra-efficient Memristor-based Accelerator for Machine Learning Inferencecited by 57
  7. 2020The Deep Learning Compiler: A Comprehensive Surveycited by 46
  8. 2018Neural Cache: Bit-Serial In-Cache Acceleration of Deep Neural Networkscited by 29
  9. 2018Intel nGraph: An Intermediate Representation, Compiler, and Executor for Deep Learningcited by 22
  10. 2021FORMS: Fine-grained Polarized ReRAM-based In-situ Computation for Mixed-signal DNN Acceleratorcited by 10
  11. 2019An Overview of In-memory Processing with Emerging Non-volatile Memory for Data-intensive Applicationscited by 5
  12. 2019FPSA: A Full System Stack Solution for Reconfigurable ReRAM-based NN Accelerator Architecturecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.