返回
Workflow simulation and multi-threading aware task scheduling for heterogeneous computing
DOI:10.1016/j.jpdc.2022.05.011.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms在 (几乎) 同构的多集群平台上调度并行任务图
Constraint Programming Approach to Reconfigurable Processor Extension Generation and Application Compilation可重构处理器扩展生成和应用程序编译的约束编程方法
Performance-effective and low-complexity task scheduling for heterogeneous computing面向异构计算的高性能低复杂度任务调度

