Efficient Reprogramming of Memristive Crossbars for DNNs: Weight Sorting and Bit Stucking
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 26 references that are in the map. First posted on arXiv 29 Oct 2024.
Builds on
7 of 26 references.
References · 7
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 263
- 2020Post-Training Piecewise Linear Quantization for Deep Neural Networkscited by 79
- 2020Layer-Wise Data-Free CNN Compressioncited by 13
- 2014Brain-like associative learning using a nanoscale non-volatile phase change synaptic device arraycited by 3
- 2024Sorted Weight Sectioning for Energy-Efficient Unstructured Sparse DNNs on Compute-in-Memory Crossbarscited by 2
- 2023Analog Feedback-Controlled Memristor programming Circuit for analog Content Addressable Memorycited by 1
Built on by
Citing papers per year: 2025: 2.
2 papers.