A novel HEFTS-L algorithm for scheduling large number of DAG tasks

DOI

10.2991/wartia-17.2017.47How to use a DOI?

Keywords

Scheduling; Business process management; DAG; HEFT algorithm; HEFTS-L algorithm

Abstract

In recent years, along with the development of technologies for distributed computing such as big data and clouds workflow systems, efficiency of workflow scheduling has become very impotent. Hence scheduling of multiple DAGs sharing on heterogeneous distributed resources has attracted intensive attention recently. This paper issues on scheduling of multiple DAGs with Deadline constraints surrounding scheduling of multiple DAGs sharing on heterogeneous distributed resources on traditional DAG-based task. It brings forward two parameter association methods to balance DAG Deadline constraint priority including relative strictness and laxity, which are used to balance priority of multiple DAGs. An improved HEFT algorithm based on priority was put forward to schedule multiple DAGs with deadline constraint. Through experiments, the phenomenon of "overload" can be detected due to the high degree of emergency of DAG scheduling. Once a task was detected, it can be selective discarded with corresponding measures, so as to maximize DAG before deadline.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xin Liu
AU  - Rongbin Xu
AU  - Yongliang Cheng
AU  - Pengfei Zhang
PY  - 2017/11
DA  - 2017/11
TI  - A novel HEFTS-L algorithm for scheduling large number of DAG tasks
BT  - Proceedings of the 3rd Workshop on Advanced Research and Technology in Industry (WARTIA 2017)
PB  - Atlantis Press
SP  - 237
EP  - 242
SN  - 2352-5401
UR  - https://doi.org/10.2991/wartia-17.2017.47
DO  - 10.2991/wartia-17.2017.47
ID  - Liu2017/11
ER  -