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

Abstract

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.

Parallel Scheduling of Multiple SDF Graphs Onto Heterogeneous Processors

“…Most of the existent approaches assume that the task graphs are all DAGs and executed only once so that the scheduling objective is to minimize the schedule length of applications. As an example, a scheduling heuristic is proposed in [28] by extending the HEFT algorithm [22] to multiple DAGs. There exist only a few techniques proposed to schedule periodic multiple SDF graphs onto multiple PEs, to the best of our knowledge.…”