The Community for Technology Leaders
Green Image
Issue No. 02 - February (2010 vol. 59)
ISSN: 0018-9340
pp: 202-217
Jean-François Pineau , ENS Lyon, University of Lyon, and LIP
Anne Benoit , ENS Lyon, University of Lyon, and LIP
Frédéric Vivien , INRIA, ENS Lyon, University of Lyon, CNRS, UCBL, and LIP
Loris Marchal , CNRS, University of Lyon, and LIP
Yves Robert , ENS Lyon, University of Lyon, and LIP
ABSTRACT
Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper, we deal with the problem of scheduling multiple applications, made of collections of independent and identical tasks, on a heterogeneous master-worker platform. The applications are submitted online, which means that there is no a priori (static) knowledge of the workload distribution at the beginning of the execution. The objective is to minimize the maximum stretch, i.e., the maximum ratio between the actual time an application has spent in the system and the time this application would have spent if executed alone. On the theoretical side, we design an optimal algorithm for the offline version of the problem (when all release dates and application characteristics are known beforehand). We also introduce a heuristic for the general case of online applications. On the practical side, we have conducted extensive simulations and MPI experiments, showing that we are able to deal with very large problem instances in a few seconds. Also, the solution that we compute totally outperforms classical heuristics from the literature, thereby fully assessing the usefulness of our approach.
INDEX TERMS
Scheduling and task partitioning, online computation, parallelism and concurrency, measurement, evaluation, modeling, simulation of multiple-processor systems.
CITATION
Jean-François Pineau, Anne Benoit, Frédéric Vivien, Loris Marchal, Yves Robert, "Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms", IEEE Transactions on Computers, vol. 59, no. , pp. 202-217, February 2010, doi:10.1109/TC.2009.117
107 ms
(Ver 3.1 (10032016))