.png){kind=icon}
返回
A scheduling algorithm for heterogeneous computing systems by edge cover queue
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2023.110369.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In heterogeneous computing systems, excellent task scheduling algorithms can shorten the task completion time and improve system parallelism. With the large-scale deployment of edge computing, the task scheduling algorithm in heterogeneous edge computing servers has become a critical factor in improving the overall system performance. This paper proposes a new task scheduling algorithm called the edge cover scheduling algorithm (ECSA), which schedules tasks based on the edge cover queue of the directed acyclic graph (DAG) for heterogeneous computing systems. Based on the estimation of distribution algorithm (EDA) and the graph random walk algorithm, the ECSA generates an edge cover queue from DAG. Then, the ECSA uses the heuristics greedy method with low time and computational complexity to allocate the edge cover queue to processors. Theoretical analysis and simulation results on random DAGs and real-world DAGs show that the ECSA can achieve better scheduling results in terms of makespan, the schedule length ratio (SLR), efficiency, and frequency of best results with low time and computational complexity.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Keyword:
Heterogeneous computing system
Edge cover queue
Estimation of distribution algorithm
Graph random walk algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Improved many-objective particle swarm optimization algorithm for scientific workflow scheduling in cloud computing面向云计算科学工作流调度的改进多目标粒子群算法
PREAI
分享收藏
Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution
PREAI
分享收藏
查看更多内容