The Community for Technology Leaders
2007 IEEE International Conference on Cluster Computing (2007)
Austin, TX, USA
Sept. 17, 2007 to Sept. 20, 2007
ISBN: 978-1-4244-1387-4
pp: 507-514
Sascha Hunold , Department of Mathematics and Physics, University of Bayreuth, Germany
Thomas Rauber , Department of Mathematics and Physics, University of Bayreuth, Germany
Gudula Runger , Department of Computer Science, Chemnitz University of Technology, Germany
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.
INDEX TERMS
CITATION

T. Rauber, S. Hunold and G. Runger, "Dynamic scheduling of multi-processor tasks on clusters of clusters," 2007 IEEE International Conference on Cluster Computing(CLUSTER), Austin, TX, USA, 2007, pp. 507-514.
doi:10.1109/CLUSTR.2007.4629277
84 ms
(Ver 3.3 (11022016))