Skip to Main content Skip to Navigation
Conference papers

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 metadata
Contributor : Jean-Michel Caricand <>
Submitted on : Friday, October 30, 2015 - 3:00:17 PM
Last modification on : Monday, November 16, 2020 - 9:58:08 AM


  • HAL Id : hal-01222766, version 1


Anne Benoit, Alexandru Dobrila, Jean Nicod, Laurent Philippe. Workload balancing and throughput optimization for heterogeneous systems subject to failures. Euro-Par 2011, 17th Int. European Conf. on Parallel and Distributed Computing, 2011, Bordeaux, France. pp.242--254. ⟨hal-01222766⟩



Record views