Steady-state scheduling of task graphs on heterogeneous computing platforms

Olivier Beaumont 1 Arnaud Legrand Loris Marchal Yves Robert
1 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 execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) between these tasks. A typical example is the repeated execution of the same algorithm on several distinct data samples. We use a non-oriented graph to model the grid platform, where resources have different speeds of computation and communication. We show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor) and how to build such as schedule. This result holds for a quite general framework, allowing for cycles and multiple paths in the platform graph.
Type de document :
RR-4870, INRIA. 2003
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 23 mai 2006 - 18:35:30
Dernière modification le : samedi 17 septembre 2016 - 01:27:17
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:34:41



  • HAL Id : inria-00071713, version 1



Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert. Steady-state scheduling of task graphs on heterogeneous computing platforms. RR-4870, INRIA. 2003. <inria-00071713>



Consultations de
la notice


Téléchargements du document