Skip to Main content Skip to Navigation

Scheduling strategies for master-slave tasking on heterogeneous processor grids

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 (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.
Document type :
Complete list of metadata
Contributor : Colette Orange Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:13:11 AM
Last modification on : Saturday, September 11, 2021 - 3:19:11 AM


Files produced by the author(s)


  • HAL Id : hal-02102060, version 1



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⟩



Les métriques sont temporairement indisponibles