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

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00563303
Contributor : Jean-Michel Caricand <>
Submitted on : Friday, February 4, 2011 - 3:39:39 PM
Last modification on : Tuesday, December 11, 2018 - 10:58:13 AM
Long-term archiving on : Tuesday, November 6, 2012 - 1:30:09 PM

File

dmnp09_ip.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00563303, version 1

Citation

Sékou Diakité, Loris Marchal, Jean-Marc Nicod, Laurent Philippe. Steady-State for Batches of Identical Task Graphs. Euro-Par'09, 2009, Netherlands. pp.203--215. ⟨hal-00563303⟩

Share

Metrics

Record views

315

Files downloads

134