arrow
返回

Workflow simulation and multi-threading aware task scheduling for heterogeneous computing

delete2022-10-01
delete8
delete
OA
AI
V
Vasilios Kelefouras *
K
Karim Djemame
DOI:10.1016/j.jpdc.2022.05.011delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Efficient application scheduling is critical for achieving high performance in heterogeneous computing systems. This problem has proved to be NP-complete even for the homogeneous case, heading research efforts in obtaining low complexity heuristics that produce good quality schedules. Such an example is HEFT, one of the most efficient list scheduling heuristics in terms of makespan and robustness. In this paper, we propose two task scheduling methods for heterogeneous computing systems that can be integrated to several task scheduling algorithms. First, a method that improves the scheduling time (the time for obtaining the output schedule) of a family of task scheduling algorithms is delivered without sacrificing the schedule length, when the computation costs of the application tasks are unknown. Second, a method that improves the scheduling length (makespan) of several task scheduling algorithms is proposed, by identifying which tasks are going to be executed as single-threaded and which as multithreaded implementations, as well as the number of the threads used. We showcase both methods by using HEFT popular algorithm, but they can be integrated to other algorithms too, such as HCPT, HPS, PETS and CPOP.]The experimental results, which consider 14580 random synthetic graphs and five real world applications, show that by enhancing HEFT algorithm with the two proposed methods, significant makespan gains and high scheduling time gains, are achieved. (C) 2022 The Author(s). Published by Elsevier Inc
Keyword:
Task scheduling
HEFT
Heterogeneity
Scheduling time
Makespan
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Parallel and Distributed Computing 封面图
Journal of Parallel and Distributed Computing
IF:
4
论文数:
3.8K
被引数:
4.8K

机构

U
University of Plymouth
学者数:
7.2K
论文数: 6.8K
被引数: 9.3K
U
university of leeds
学者数:
3.6W
论文数: 3.3W
被引数: 45
引用论文

引用论文

err分享
err收藏
Characterizing and profiling scientific workflows表征和分析科学工作流
err2013-03-01
err626
PREAI
errJuve, Gideon; Chervenak, Ann; Deelman, Ewa; Bharathi, Shishir; Mehta, Gaurang; Vahi, Karan
err分享
err收藏
err分享
err收藏
学者 查看更多内容