Scheduling strategies for master-slave tasking on heterogeneous processor grids - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2002

Scheduling strategies for master-slave tasking on heterogeneous processor grids

(1) , (1) , (1) , (1)
1

Résumé

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 (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the interconnection graph, and allowing for several masters.
Fichier principal
Vignette du fichier
RR2002-12.pdf (371.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02102060 , version 1 (17-04-2019)

Identifiants

  • HAL Id : hal-02102060 , version 1

Citer

Cyril Banino, Olivier Beaumont, Arnaud Legrand, Yves Robert. Scheduling strategies for master-slave tasking on heterogeneous processor grids. [Research Report] LIP RR-2002-12, Laboratoire de l'informatique du parallélisme. 2002, 2+29p. ⟨hal-02102060⟩
14 Consultations
193 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More