GLOBECOM 2020 - 2020 IEEE Global Communications Conference 2020
DOI: 10.1109/globecom42002.2020.9348161
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Computation Offloading and Resource Allocation for Multi-user Mobile Edge Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…Peng et al [23] leveraged the deep deterministic policy gradient (DDPG) and hierarchical learning architectures to jointly solve the spectrum, computation and storage allocation problem in an EC based system. Recent studies [24], [25] solved the computation offloading and resource allocation problem for multiple mobile users in EC based systems by utilizing the DDPG-based framework and proposing the sate-of-the-art algorithms. Wang et al [26] jointly optimized the communication, computation and caching resources problem in an EC scenario by utilizing a twin-actor DDPG framework.…”
Section: B Machine Learning-based Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…Peng et al [23] leveraged the deep deterministic policy gradient (DDPG) and hierarchical learning architectures to jointly solve the spectrum, computation and storage allocation problem in an EC based system. Recent studies [24], [25] solved the computation offloading and resource allocation problem for multiple mobile users in EC based systems by utilizing the DDPG-based framework and proposing the sate-of-the-art algorithms. Wang et al [26] jointly optimized the communication, computation and caching resources problem in an EC scenario by utilizing a twin-actor DDPG framework.…”
Section: B Machine Learning-based Methodsmentioning
confidence: 99%
“…Suppose C represents the number of CPU cycles required to process 1 Byte of data, then L u is given as the total CPU cycles required to compute data d u (L u = d u × C). A similar task computation model (with CPU cycles) is proposed in [24], [25] as well.…”
Section: B Users and Jobs Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…Computation offloading strategies have been studied extensively [116][117][118][119] and generally fall under two categories, full offloading (coarse-grained) [120] and partial offloading (fine-grained) [91], [121][122][123][124]. For coarse-grained mode, the data set of a task has to be executed as a whole either locally or remotely on an edge server.…”
Section: Offloading Strategiesmentioning
confidence: 99%