English

Efficient Reprogramming of Memristive Crossbars for DNNs: Weight Sorting and Bit Stucking

Hardware Architecture 2025-07-10 v1 Artificial Intelligence Emerging Technologies Machine Learning

Abstract

We introduce a novel approach to reduce the number of times required for reprogramming memristors on bit-sliced compute-in-memory crossbars for deep neural networks (DNNs). Our idea addresses the limited non-volatile memory endurance, which restrict the number of times they can be reprogrammed. To reduce reprogramming demands, we employ two techniques: (1) we organize weights into sorted sections to schedule reprogramming of similar crossbars, maximizing memristor state reuse, and (2) we reprogram only a fraction of randomly selected memristors in low-order columns, leveraging their bit-level distribution and recognizing their relatively small impact on model accuracy. We evaluate our approach for state-of-the-art models on the ImageNet-1K dataset. We demonstrate a substantial reduction in crossbar reprogramming by 3.7x for ResNet-50 and 21x for ViT-Base, while maintaining model accuracy within a 1% margin.

Keywords

Cite

@article{arxiv.2410.21730,
  title  = {Efficient Reprogramming of Memristive Crossbars for DNNs: Weight Sorting and Bit Stucking},
  author = {Matheus Farias and H. T. Kung},
  journal= {arXiv preprint arXiv:2410.21730},
  year   = {2025}
}

Comments

5 pages, 10 figures

R2 v1 2026-06-28T19:39:10.107Z