针对边缘计算中推理时间不确定问题,提出低能耗鲁棒调度方案。
Robust DNN Partitioning and Resource Allocation Under Uncertain Inference Time
- 仅需均值与方差信息,通过概率约束转化实现鲁棒优化
- 在满足概率截止时间条件下,显著降低移动设备能耗
- 适用于资源受限的实时边缘智能系统,无需复杂预测
在边缘智能系统中,深度神经网络(DNN)分割与数据卸载可为资源受限的移动设备提供实时任务推理。然而,DNN的推理时间通常具有不确定性,难以提前精确确定,给任务按时处理带来挑战。为此,本文提出一种鲁棒优化方案,在满足任务概率截止时间的前提下,最小化移动设备总能耗。该方案仅需推理时间的均值和方差信息,无需分布假设或预测方法。问题建模为包含混合整数非线性规划(MINLP)的联合优化问题,涉及DNN模型分割及本地CPU/GPU频率与上行链路带宽分配。通过分解为资源分配与模型分割两个子问题,并利用机会约束规划(CCP)将概率约束转化为确定性形式,再分别采用凸优化与惩罚凸-凹过程(PCCP)求解资源分配最优解和模型分割的驻点解。算法基于主流硬件平台的真实数据,在常用DNN模型上评估。大量仿真表明,所提算法能有效应对推理时间不确定性,在保障概率截止时间的同时显著降低移动设备能耗。
原文摘要 · Abstract (English)
In edge intelligence systems, deep neural network (DNN) partitioning and data offloading can provide real-time task inference for resource-constrained mobile devices. However, the inference time of DNNs is typically uncertain and cannot be precisely determined in advance, presenting significant challenges in ensuring timely task processing within deadlines. To address the uncertain inference time, we propose a robust optimization scheme to minimize the total energy consumption of mobile devices while meeting task probabilistic deadlines. The scheme only requires the mean and variance information of the inference time, without any prediction methods or distribution functions. The problem is formulated as a mixed-integer nonlinear programming (MINLP) that involves jointly optimizing the DNN model partitioning and the allocation of local CPU/GPU frequencies and uplink bandwidth. To tackle the problem, we first decompose the original problem into two subproblems: resource allocation and DNN model partitioning. Subsequently, the two subproblems with probability constraints are equivalently transformed into deterministic optimization problems using the chance-constrained programming (CCP) method. Finally, the convex optimization technique and the penalty convex-concave procedure (PCCP) technique are employed to obtain the optimal solution of the resource allocation subproblem and a stationary point of the DNN model partitioning subproblem, respectively. The proposed algorithm leverages real-world data from popular hardware platforms and is evaluated on widely used DNN models. Extensive simulations show that our proposed algorithm effectively addresses the inference time uncertainty with probabilistic deadline guarantees while minimizing the energy consumption of mobile devices.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。