Dynamic scheduling of multi-processor tasks on clusters of clusters

Authors:
Sascha Hunold;Thomas Rauber;Gudula Runger
Affiliations:
Department of Mathematics and Physics, University of Bayreuth, Germany;Department of Mathematics and Physics, University of Bayreuth, Germany;Department of Computer Science, Chemnitz University of Technology, Germany
Venue:
CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
Year:
2007

Citing 0
Cited 2

Scheduling mixed-parallel applications with advance reservations

HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Queue waiting time aware dynamic workflow scheduling in multicluster environments

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach in the context of TGrid. TGrid is an M-task runtime system for heterogeneous clusters. Then, we propose a dynamic scheduling algorithm called Reuse Processors Algorithm (RePA). The main objective of RePA is to reduce the communication and redistribution costs by trying to map child tasks to processors which are assigned to parent tasks (reuse processors). The algorithm is implemented using the SimGrid toolkit and is evaluated by comparing the makespan of the schedules produced by RePA and M-HEFT.