Proceedings of the 2019 4th International Conference on Mathematics and Artificial Intelligence 2019
DOI: 10.1145/3325730.3325731
|View full text |Cite
|
Sign up to set email alerts
|

Deep Reinforcement Learning Based Delay-Sensitive Task Scheduling and Resource Management Algorithm for Multi-User Mobile-Edge Computing Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…In [37], an intelligent offloading system for vehicular edge computing by leveraging DRL was constructed, in which both communication and computation states were modelled by the finite Markov chains. In [38], the authors investigated the problem of delay sensitive task scheduling and resource management on the server side in multiuser MEC scenario, where a new online algorithm based on DRL was devised to reduce average slowdown and average timeout period of tasks in the queue. In [39], the computing aware scheduling strategy in MEC was proposed, in which a support vector machine based multiclass classifier was adopted.…”
Section: Drl-based Methodsmentioning
confidence: 99%
“…In [37], an intelligent offloading system for vehicular edge computing by leveraging DRL was constructed, in which both communication and computation states were modelled by the finite Markov chains. In [38], the authors investigated the problem of delay sensitive task scheduling and resource management on the server side in multiuser MEC scenario, where a new online algorithm based on DRL was devised to reduce average slowdown and average timeout period of tasks in the queue. In [39], the computing aware scheduling strategy in MEC was proposed, in which a support vector machine based multiclass classifier was adopted.…”
Section: Drl-based Methodsmentioning
confidence: 99%
“…The four benchmarks are: 1) Random, which selects ONU requests randomly, 2) the shortest request first algorithm (SRF), which serves ONU requests in the ascending order of their duration [30], 3) the resource wrapper Packer algorithm [31], which assigns resource according to the order of alignment between resource requirements and resource availability, 4) the synthesis Tetris algorithm, which balances the advantages of taking short-term request and resource packaging [32].…”
Section: A Simulation Setupmentioning
confidence: 99%
“…Extensive numerical simulations are conducted to evaluate the performance of our proposed DRL-based DSA scheme. Note that the bassline heuristics used in the simulation part, such as Tetris, SJF, Packer and Random [30][31][32], generally use fixed policy to schedule the serving order of ONU requests. When network state changes, these fixed policies cannot adapt to the changes of the network state.…”
Section: Introductionmentioning
confidence: 99%
“…Scheduling and resource management algorithm for multi-user mobile-edge computing systems Meng et al (2019) The problem of delay-sensitive task scheduling and resource (e.g., CPU, memory) management on the server side in multi-user MEC scenario…”
Section: Algorithm Idea Advantagementioning
confidence: 99%
“… Wei et al (2018) proposed an intelligent QoS aware job scheduling framework based on Deep Q-Learning algorithm, which can effectively reduce the average response time of jobs under varying loads and improve user satisfaction. Meng et al (2019) designed an adaptive online scheduling algorithm by combining reinforcement learning with DNN, which significantly improved the scheduling efficiency of server-side task queues. Ran et al (2019) used the Deep Determining Policy Gradient (DDPG) algorithm to find the optimal task assignment scheme meeting the requirements of the Service Level Agreement (SLA).…”
Section: Related Workmentioning
confidence: 99%