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 :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02102060
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:13:11 AM
Last modification on : Wednesday, November 20, 2019 - 2:52:28 AM

File

RR2002-12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102060, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

13

Files downloads

56