Steady-State for Batches of Identical Task Graphs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Steady-State for Batches of Identical Task Graphs


In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance, thus making steady-state scheduling applicable to smaller batches. The problem is proven NP-complete, and a mixed integer program is presented to solve it. Then, different solutions, using steady-state scheduling or not, are evaluated through comprehensive simulations.
Fichier principal
Vignette du fichier
RR-europar.pdf (166.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00412953 , version 1 (02-09-2009)


  • HAL Id : ensl-00412953 , version 1


Sékou Diakité, Loris Marchal, Jean-Marc Nicod, Laurent Philippe. Steady-State for Batches of Identical Task Graphs. 2009. ⟨ensl-00412953⟩
106 View
87 Download


Gmail Facebook Twitter LinkedIn More