Orchestrating Multimodal DNN Workloads in Wireless Neural Processing
Organizations: Department of Electronic and Electrical Engineering, University College London, WC1E 7JE, London, UK · Department of Electronic Engineering, Kyung Hee University, Yongin-si, Gyeonggi-do 17104, Republic of Korea · School of Electrical and Electronic Engineering, the University of Sheffield, Sheffield S10 2TN, UK · Department of Electronics and Information Convergence Engineering, Kyung Hee University, Yongin-si, Gyeonggi-do 17104, Republic of Korea
Abstract
In edge inference, wireless resource allocation and accelerator-level deep neural network (DNN) scheduling have yet to be co-optimized in an end-to-end manner. The lack of coordination between wireless transmission and accelerator-level DNN execution prevents efficient overlap, leading to higher end-to-end inference latency. To address this issue, this paper investigates multimodal DNN workload orchestration in wireless neural processing (WNP), a paradigm that integrates wireless transmission and multi-core accelerator execution into a unified end-to-end pipeline. First, we develop a unified communication-computation model for multimodal DNN execution and formulate the corresponding optimization problem. Second, we propose O-WiN, a framework that orchestrates DNN workloads in WNP through two tightly coupled stages: simulation-based optimization and runtime execution. Third, we develop two algorithms, RTFS and PACS. RTFS schedules communication and computation sequentially, whereas PACS interleaves them to enable pipeline parallelism by overlapping wireless data transfer with accelerator-level DNN execution. Simulation results demonstrate that PACS significantly outperforms RTFS under high modality heterogeneity by better masking wireless latency through communication-computation overlap, thereby highlighting the effectiveness of communication-computation pipelining in accelerating multimodal DNN execution in WNP.
Figures & tables
| Symbol | Description | Symbol | Description |
|---|---|---|---|
| Computation DAG of the multimodal DNN | Vertex set and edge set of | ||
| Predecessor/successor sets of job | Precedence constraint: can start only after finishes | ||
| Set of modalities (sensor nodes) | Subgraph for modality | ||
| Set of accelerator cores | Start/finish time of job | ||
| Job-to-core assignment indicator | Processing time of job on core | ||
| Feasible schedules on core | Total NoC bandwidth budget |
| Parameter | Symbol | Value / Range |
| Number of nodes/modalities | 6 | |
| Slice token sizes | — | |
| Payload model | — | , fp16 ( bytes), overhead |
| Compression factors | — | |
| Slice sizes | kB | |
| Accelerator cores | 4 |
| Slice token sizes | Compression factors | Compression factors | Compression factors | Compression factors | Compression factors | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| RTFS | PACS | Gain | RTFS | PACS | Gain | RTFS | PACS | Gain | RTFS | PACS | Gain | RTFS | PACS | Gain | |
| 113.92 | 113.92 | 0.00% | 105.92 | 104.92 | +0.94% | 114.92 | 116.92 | -1.74% | 126.92 | 126.94 | -0.02% | 134.92 | 132.43 | +1.85% | |
| 154.87 | 143.83 | +7.13% | 150.87 | 141.47 | +6.23% | 168.87 | 161.41 | +4.42% | 191.87 | 181.47 | +5.42% | 196.87 | 184.59 | +6.24% | |
| 139.15 | 126.34 | +9.21% | 132.15 | 132.15 | 0.00% | 145.15 | 136.53 | +5.94% | 157.15 | 148.54 | +5.48% | 168.15 | 155.52 | +7.51% | |
| 205.60 | 166.39 | +19.08% | 189.60 | 153.39 | +19.10% | 204.60 | 168.39 | +17.70% | 217.60 | 180.39 | +17.10% | 231.60 | 191.39 | +17.36% | |
| 230.33 | 193.66 | +15.92% | 213.33 | 179.66 | +15.78% | 230.33 | 192.66 | +16.36% | 236.33 | 199.66 | +15.52% | 236.33 | 199.66 | +15.52% | |
Efficient Multimodal Inference
Efficient multimodal inference reduces the compute, memory, latency, and energy needed to process image, video, audio, text, and sensor inputs.
See all 227 papers