.png){kind=icon}
.png){kind=icon}
Return
Dependent Task Offloading for Edge Computing based on Deep Reinforcement Learning
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2021.3131040.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Edge computing is an emerging promising computing paradigm that brings computation and storage resources to the network edge, hence significantly reducing the service latency and network traffic. In edge computing, many applications are composed of dependent tasks where the outputs of some are the inputs of others. How to offload these tasks to the network edge is a vital and challenging problem which aims to determine the placement of each running task in order to maximize the Quality-of-Service (QoS). Most of the existing studies either design heuristic algorithms that lack strong adaptivity or learning-based methods but without considering the intrinsic task dependency. Different from the existing work, we propose an intelligent task offloading scheme leveraging off-policy reinforcement learning empowered by a Sequence-to-Sequence (S2S) neural network, where the dependent tasks are represented by a Directed Acyclic Graph (DAG). To improve the training efficiency, we combine a specific off-policy policy gradient algorithm with a clipped surrogate objective. We then conduct extensive simulation experiments using heterogeneous applications modelled by synthetic DAGs. The results demonstrate that: 1) our method converges fast and steadily in training; 2) it outperforms the existing methods and approximates the optimal solution in latency and energy consumption under various scenarios.
Keywords:
Task analysis
Neural networks
Wireless communication
Energy consumption
Training
Reinforcement learning
Solid modeling
Multi-access edge computing
task offloading
deep reinforcement learning
sequence to sequence neural networks
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
View more organizations