.png){kind=icon}
返回
Comments on IPPTS: An Efficient Algorithm for Scientific Workflow Scheduling in Heterogeneous Computing Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2022.3232326.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
IPPTS (Improved Predict Priority Task Scheduling) is a list scheduling algorithm that schedules task graphs on fully connected heterogeneous distributed systems, with an objective of minimizing the overall makespan (i.e., schedule length). With respect to the literature on list scheduling techniques for task graphs, IPPTS improves the task prioritization by considering the out-degree of a task. However, we have observed that the IPPTS algorithm contains an ambiguity which introduces the possibility of assigning higher priority to a task compared to its predecessors in a task graph. This priority inversion may lead to the generation of an incorrect schedule due to the violation of precedence-constraints among tasks. In this note, we first highlight this issue using a counter example. Then, we discuss two possible ways to fix the ambiguity in the algorithm.
Keyword:
List scheduling
scientific workflows
task graphs
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Performance-effective and low-complexity task scheduling for heterogeneous computing面向异构计算的高性能低复杂度任务调度
.png){kind=icon}
PREAI
分享收藏IPPTS: An Efficient Algorithm for Scientific Workflow Scheduling in Heterogeneous Computing SystemsIPPTS: 异构计算系统中科学工作流调度的有效算法
PREAI
分享收藏