Accurate and High-Throughput Analog-Digital DNN Acceleration using Sub-Network Scheduling
- Authors
- Kim, Jintae; Jeong, Byoungjun; Kim, Changdae; Ryu, Narae; Pak, Eunji; Lee, Hunjun
- Issue Date
- Jan-2026
- Publisher
- IEEE COMPUTER SOC
- Keywords
- Accuracy; Throughput; Computational modeling; Load modeling; Analog-digital conversion; Personal digital devices; Runtime; Noise; Hardware; Processor scheduling; Compute-in-memory; hybrid analog-digital system; accuracy scaling; sub-network scheduling
- Citation
- IEEE COMPUTER ARCHITECTURE LETTERS, v.25, no.1, pp 97 - 100
- Pages
- 4
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE COMPUTER ARCHITECTURE LETTERS
- Volume
- 25
- Number
- 1
- Start Page
- 97
- End Page
- 100
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/214007
- DOI
- 10.1109/LCA.2026.3668766
- ISSN
- 1556-6056
1556-6064
- Abstract
- Analog Computing-in-Memory (ACiM) devices perform matrix operations directly within memory arrays, offering high throughput for deep neural network inference. At the same time, they are susceptible to various noise sources, which reduces the computational accuracy. This inherent trade-off limits the adoption of ACiM devices as a stand-alone accelerator. In this paper, we propose the first heterogeneous inference-serving framework that coordinates ACiM hardware and conventional digital processors during inference. The system dynamically partitions each neural network into an analog sub-network executed on high-throughput ACiM devices and a digital sub-network handled by precise digital devices. Then, it integrates a transition layer and a custom training strategy to maintain accuracy across varying analog-digital partitions. Also, it adopts a two-level scheduler to adjust the partition ratio at runtime in response to varying query demands. We evaluate our system using five network models to demonstrate the benefits of our system.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.