Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Steady-State for Batches of Identical Task Graphs

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Loris Marchal Connect in order to contact the contributor
Submitted on : Wednesday, September 2, 2009 - 5:28:51 PM
Last modification on : Tuesday, October 25, 2022 - 4:16:41 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 10:11:16 AM


Files produced by the author(s)


  • HAL Id : ensl-00412953, version 1


Sékou Diakité, Loris Marchal, Jean-Marc Nicod, Laurent Philippe. Steady-State for Batches of Identical Task Graphs. {date}. ⟨ensl-00412953⟩



Record views


Files downloads