Steady-state scheduling of task graphs on heterogeneous computing platforms

Olivier Beaumont 1, 2 Arnaud Legrand Loris Marchal Yves Robert 2
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.
Document type :
Reports
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071713
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:35:30 PM
Last modification on : Tuesday, May 21, 2019 - 9:44:13 AM

Identifiers

  • HAL Id : inria-00071713, version 1

Collections

Citation

Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert. Steady-state scheduling of task graphs on heterogeneous computing platforms. [Research Report] RR-4870, LIP RR-2003-29, INRIA, LIP. 2003. ⟨inria-00071713⟩

Share

Metrics

Record views

200

Files downloads

439