Prioritized Assignment With Task Dependency in Collaborative Mobile Edge Computing
IEEE Transactions on Mobile Computing · 2024-12 · 23 (12) · 13505-13521
DOI: 10.1109/tmc.2024.3427380 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, 2024-12. Verfasst von Qing Cai und 4 weiteren Autor:innen. Die Arbeit wurde bisher 31-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: National Key Research and Development Program of China.
Abstract (Originalsprache)
Collaborative mobile edge computing enables resource-constrained edge facilities to work cooperatively for computation-intensive tasks. However, as the number of tasks demanded by various applications increases, resource competition is inevitable in edge facilities. Existing works tackle the resource competition problem with a first come first served (FCFS) scheme, which is blind to different delay requirements among tasks. This may result in tasks with higher delay requirements waiting a long time for service, thereby reducing overall service quality. This paper proposes a prioritized queuing scheme with task dependency (PQTD), which allows high-prioritized sub-tasks with higher delay requirements to jump into the queue ahead of low-prioritized sub-tasks with lower delay requirements. To describe the complicated delay change caused by queue-jumping, a joint DAG-queue delay (JDQD) model is proposed, which analyzes the chain reaction of delay changes caused by the processing queue on the server and the task dependency. With JDQD, a multi-task assignment optimization problem is formulated to maximize the average satisfaction degree (AvgSatD), which is defined according to the priorities of the tasks and their delay requirements. Then, a tree-based algorithm is proposed to solve the NP-hard optimization problem, i.e., Monte Carlo Tree Search (MCTS). Simulation results demonstrate the effectiveness of the PQTD queuing scheme and tree search mechanism of MCTS. Overall, PQTD + MCTS can increase AvgSatD by at least 45.8% with an acceptable complexity.
Förderung
- National Key Research and Development Program of China
Zitieren
APA
Cai, Q., Zhou, Y., Liu, L., Qi, Y., & Shi, J. (2024). Prioritized Assignment With Task Dependency in Collaborative Mobile Edge Computing. IEEE Transactions on Mobile Computing, 23(12), 13505-13521. https://doi.org/10.1109/tmc.2024.3427380
Vancouver
Cai Q, Zhou Y, Liu L, Qi Y, Shi J. Prioritized Assignment With Task Dependency in Collaborative Mobile Edge Computing. IEEE Transactions on Mobile Computing. 2024;23(12):13505-13521. doi:10.1109/tmc.2024.3427380
BibTeX
@article{Cai2024,
author = {Cai, Qing and Zhou, Yiqing and Liu, Ling and Qi, Yanli and Shi, Jinglin},
title = {Prioritized Assignment With Task Dependency in Collaborative Mobile Edge Computing},
journal = {IEEE Transactions on Mobile Computing},
year = {2024},
volume = {23},
number = {12},
pages = {13505--13521},
doi = {10.1109/tmc.2024.3427380}
}
EUVIMED