2019 IEEE Global Communications Conference (GLOBECOM) 2019
DOI: 10.1109/globecom38437.2019.9013404
|View full text |Cite
|
Sign up to set email alerts
|

Deep Neural Network Task Partitioning and Offloading for Mobile Edge Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 15 publications
0
11
0
Order By: Relevance
“…Refs. [ 6 , 21 , 22 ] also adopt similar strategies in order to identify the best partition points. However, unlike other works using exhaustive searching, ref.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Refs. [ 6 , 21 , 22 ] also adopt similar strategies in order to identify the best partition points. However, unlike other works using exhaustive searching, ref.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, unlike other works using exhaustive searching, ref. [ 22 ] solves the problem by mixed integer linear programming.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In recent years, optimization methods based on reinforcement learning [17][18][19][20] and artificial intelligence [21,22] have emerged. A reinforcement learning-based online computation offloading approach for block chainempowered mobile edge computing was proposed in [17].…”
Section: Related Workmentioning
confidence: 99%
“…In [18], deep reinforcement learning is first proposed to solve the offloading problem of multiple service nodes for the cluster and multiple dependencies for mobile tasks in large-scale heterogeneous MEC. Gao et al investigated a DNN based MEC scheme considering multiple mobile devices and one MEC server in [19]. A Q-learning based flexible task scheduling with global view (QFTS-GV) scheme is proposed to improve task scheduling success rate, reduce delay, and extend lifetime for the IoT in [20].…”
Section: Related Workmentioning
confidence: 99%
“…In addition, they proposed a two-timescale algorithm by applying the Lyapunov stochastic optimization and matching theory to find the optimal UE-server association, task offloading, and resource allocation. Moreover, Gao et al [18] proposed a DNN inference delay prediction model to estimate the processing delays that vary depending on the DNN model partition pattern and then formulated the joint problem as a mixedinteger linear programming (MILP) problem. Meanwhile, He et al [19] formulated a joint optimization problem as a mixed-integer nonlinear programming (MINLP) problem, decomposed the optimization problem into a computing resource allocation (CRA) and a DNN partition deployment (DPD), and then devised low-complexity algorithms using the Markov approximation to find the suboptimal solution in polynomial time.…”
Section: B Computation Offloading Decision Algorithmsmentioning
confidence: 99%