.png){kind=icon}
返回
Task Scheduling for Mobile Edge Computing Using Genetic Algorithm and Conflict Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TVT.2020.2995146.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider parallel and sequential task offloading to multiple mobile edge computing servers. The task consists of a set of inter-dependent sub-tasks, which are scheduled to servers to minimize both offloading latency and failure probability. Two algorithms are proposed to solve the scheduling problem, which are based on genetic algorithm and conflict graph models, respectively. Simulation results show that these algorithms provide performance close to the optimal solution, which is obtained through exhaustive search. Furthermore, although parallel offloading uses orthogonal channels, results demonstrate that the sequential offloading yields a reduced offloading failure probability when compared to the parallel offloading. On the other hand, parallel offloading provides less latency. However, as the dependency among sub-tasks increases, the latency gap between parallel and sequential schemes decreases.
Keyword:
Servers
Task analysis
Mobile handsets
Delays
Computational modeling
Processor scheduling
Energy consumption
Conflict graphs
genetic algorithms
mobile edge computing
parallel offloading
sequential offloading
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容