Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids

Cyril Banino 1 Olivier Beaumont 1, 2 Arnaud Legrand 3 Yves Robert 3
2 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
INRIA Futurs, Université Bordeaux Segalen - Bordeaux 2, Université Sciences et Technologies - Bordeaux 1, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
3 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a non-oriented graph to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We show how to determine the optimal steady-state scheduling strategy for each processor. Because spanning trees are easier to deal with in practice, a natural question arises: how to extract the best spanning tree, i.e. the one with optimal steady-state throughput, out of a general interconnection graph? We show that this problem is NP-Complete. Still, we introduce and compare several low-complexity heuristics to determine a sub-optimal spanning tree.
Complete list of metadatas

https://hal.inria.fr/hal-00789455
Contributor : Arnaud Legrand <>
Submitted on : Monday, February 18, 2013 - 11:51:47 AM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM

Links full text

Identifiers

Citation

Cyril Banino, Olivier Beaumont, Arnaud Legrand, Yves Robert. Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids. PARA\'02: International Conference on Applied Parallel Computing, Jun 2002, Espoo, Finland. pp.423―432, ⟨10.1007/3-540-48051-X_42⟩. ⟨hal-00789455⟩

Share

Metrics

Record views

237