Workload balancing and throughput optimization for heterogeneous systems subject to failures

Abstract : In this report, we study the problem of optimizing the throughput of applications for heterogeneous platforms subject to failures. The considered applications are composed of a sequence of consecutive tasks linked as a linear graph (pipeline), with a type associated to each task. The challenge is to specialize the machines of a target platform to process only one task type, given that every machine is able to process all the types before being specialized, to avoid costly context or setup changes. Each instance can thus be performed by any machine specialized in its type and the workload of the system can be shared among a set of specialized machines. For identical machines, we prove that an optimal solution can be computed in polynomial time. However, the problem becomes NP-hard when two machines can compute the same task type at different speeds. Several polynomial time heuristics are presented for the most realistic specialized settings. Experimental results show that the best heuristics obtain a good throughput, much better than the throughput obtained with a random mapping, and close to the optimal throughput in the particular cases on which the optimal throughput can be computed.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00565151
Contributor : Anne Benoit <>
Submitted on : Friday, February 11, 2011 - 10:30:22 AM
Last modification on : Friday, July 6, 2018 - 3:06:08 PM
Long-term archiving on : Tuesday, November 6, 2012 - 1:50:31 PM

File

RR-7532.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00565151, version 1

Citation

Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe. Workload balancing and throughput optimization for heterogeneous systems subject to failures. [Research Report] RR-7532, INRIA. 2011, pp.22. ⟨inria-00565151⟩

Share

Metrics

Record views

343

Files downloads

192