Computing the throughput of replicated workflows on heterogeneous platforms

Anne Benoit 1, 2 Yves Robert 1, 2 Bruno Gaujal 2, 3
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : In this paper, we focus on computing the throughput of replicated workflows. Given a streaming application whose dependence graph is a linear chain, and a mapping of this application onto a fully heterogeneous platform, how can we compute the optimal throughput, or equivalently the minimal period? The problem is easy when workflow stages are not replicated, i.e., assigned to a single processor: in that case the period is dictated by the critical hardware resource. But when stages are replicated, i.e., assigned to several processors, the problem gets surprisingly complicated, and we provide examples where the optimal period is larger than the largest cycle-time of any resource. We then show how to model the problem as a timed Petri net to compute the optimal period in the general case, and we provide a polynomial algorithm for the one-port communication model with overlap. Finally, we report comprehensive simulation results on the gap between the optimal period and the largest resource cycle-time.
Type de document :
[Research Report] RR-6865, INRIA. 2009, pp.23
Liste complète des métadonnées
Contributeur : Matthieu Gallet <>
Soumis le : mercredi 4 mars 2009 - 15:43:47
Dernière modification le : vendredi 20 avril 2018 - 15:44:24


  • HAL Id : inria-00365795, version 1


Anne Benoit, Yves Robert, Bruno Gaujal. Computing the throughput of replicated workflows on heterogeneous platforms. [Research Report] RR-6865, INRIA. 2009, pp.23. 〈inria-00365795〉



Consultations de la notice