Distributing Inference Tasks Over Interconnected Systems Through Dynamic DNNs
- 26 February 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (4) , 1717-1730
Abstract
An increasing number of mobile applications leverage deep neural networks (DNN) as an essential component to adapt to the operational context at hand and provide users with an enhanced experience. It is thus of paramount importance that network systems support the execution of DNN inference tasks in an efficient and sustainable way. Matching the diverse resources available at the mobile-edge-cloud network tiers with the applications requirements and the complexity of their, while minimizing energy consumption, is however challenging. A possible approach to the problem consists in exploiting the emerging concept of dynamic DNNs, characterized by multi-branched architectures with early exits enabling sample-based adaptation of the model depth. We leverage this concept and address the problem of deploying portions of DNNs with early exits across the mobile-edge-cloud system and allocating therein the necessary network, computing, and memory resources. We do so by developing a 3-stage graph-modeling method that allows us to represent the characteristics of the system and the applications as well as the possible options for splitting the DNN over the multi-tier network nodes. Our solution, called Feasible Inference Graph (FIN), can determine the DNN split, deployment, and resource allocation that minimizes the inference energy consumption while satisfying the nodes’ constraints and the requirements of multiple, co-existing applications. FIN closely matches the optimum and leads to over 89% energy savings with respect to state-of-the-art alternatives.Keywords
This publication has 53 references indexed in Scilit:
- Knowledge Distillation: A SurveyInternational Journal of Computer Vision, 2021
- Complex Human Action Recognition Using a Hierarchical Feature Reduction and Deep Learning-Based MethodSN Computer Science, 2021
- Layered graph approaches for combinatorial optimization problemsComputers & Operations Research, 2019
- A Systematic DNN Weight Pruning Framework Using Alternating Direction Method of Multipliers2018
- Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman ProblemEuropean Journal of Operational Research, 2017
- Neural Network Methods for Natural Language Processing2017
- Load-dependent and precedence-based models for pickup and delivery problemsComputers & Operations Research, 2015
- Towards “Ideal Multistart”. A stochastic approach for locating the minima of a continuous function inside a bounded domainApplied Mathematics and Computation, 2009
- A template for scatter search and path relinking1998
- Steiner tree problemsNetworks, 1992