EDBT 2026 Demo / reviewers in the wild / expert
Matheus Farias
dblp:115/4613
· DBLP profile ↗
4ranked-venue papers
3as first author
3since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 3 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MDM: Manhattan Distance Mapping of DNN Weights for Parasitic-Resistance-Resilient Memristive Crossbars
Matheus Farias, Wanghley Martins, H. T. Kung 0001 |
ISCAS | 1 |
| 2025 | Efficient Reprogramming of Memristive Crossbars for DNNs: Weight Sorting and Bit StuckingabstractWe 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 restricts 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 count by 3.7x for ResNet-50 and 21x for ViT-Base, while maintaining model accuracy within a 1% margin. Matheus Farias, H. T. Kung 0001 |
ISCAS | 1 |
| 2025 | Sorted Weight Sectioning for Energy-Efficient Unstructured Sparse DNNs on Compute-in-Memory CrossbarsabstractWe introduce sorted weight sectioning (SWS): a weight allocation algorithm that places sorted deep neural network (DNN) weight sections on bit-sliced compute-in-memory (CIM) crossbars to reduce analog-to-digital converter (ADC) energy consumption. Data conversions are the most energy-intensive process in crossbar operation. SWS effectively reduces the ADC cost by leveraging (1) small weights and (2) zero weights (weight sparsity) present in DNNs.DNN weights follow bell-shaped distributions, with most weights near zero. Under SWS, we only need low-order crossbar columns for sections with low-magnitude weights. This reduces the quantity and resolution of ADCs required without significantly degrading DNN accuracy.Unstructured sparsification further sharpens the weight distribution with small accuracy loss. However, it presents challenges in hardware tracking of zeros: we cannot switch zero rows to other layer weights in unsorted crossbars without index matching. SWS uses offline remapping of zeros into earlier sections to exploit full sparsity potential and maximize energy efficiency.SWS reduces ADC energy use by 89.5% on unstructured sparse BERT models. Overall, this paper introduces a novel algorithm to allow energy-efficient CIM crossbars for unstructured sparse DNN workloads. Matheus Farias, H. T. Kung 0001 |
ISCAS | 1 |
| 2012 | A Framework for Context-Aware Systems in Mobile Devices
Eduardo Jorge, Matheus Farias, Rafael Carmo, Weslley Vieira |
ICCSA (4) | 2 |