Scheduling strategies for master-slave tasking on heterogeneous processor grids

Cyril Banino (1) , Olivier Beaumont (1) , Arnaud Legrand (1) , Yves Robert (1)

1 LIP - Laboratoire de l'Informatique du Parallélisme

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.

Mots clés: Communication; Complexity; Heterogeneous Processors; Master-Slave Tasking; Spanning Trees

Domaines: Informatique [cs]

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⟩