Computing the throughput of probabilistic and replicated streaming applications

Anne Benoit 1, 2 Fanny Dufossé 1, 2 Matthieu Gallet 1, 2 Bruno Gaujal 3 Yves Robert 1, 2
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 investigate how to compute the throughput of probabilistic and replicated streaming applications. We are given (i) a streaming application whose dependence graph is a linear chain; (ii) a one-to-many mapping of the application onto a fully heterogeneous target, where a processor is assigned at most one application stage, but where a stage can be replicated onto a set of processors; and (iii) a set of IID (Independent and Identically-Distributed) variables to model each computation and communication time in the mapping. How can we compute the throughput of the application, i.e., the rate at which data sets can be processed? We consider two execution models, the STRICT model where the actions of each processor are sequentialized, and the OVERLAP model where a processor can compute and communicate in parallel. The problem is easy when application stages are not replicated, i.e., assigned to a single processor: in that case the throughput is dictated by the critical hardware resource. However, when stages are replicated, i.e., assigned to several processors, the problem becomes surprisingly complicated: even in the deterministic case, the optimal throughput may be lower than the smallest internal resource throughput. To the best of our knowledge, the problem has never been considered in the probabilistic case. The first main contribution of the paper is to provide a general method (although of exponential cost) to compute the throughput when mapping parameters follow IID exponential laws. This general method is based upon the analysis of timed Petri nets deduced from the application mapping; it turns out that these Petri nets exhibit a regular structure in the OVERLAP model, thereby enabling to reduce the cost and provide a polynomial algorithm. The second main contribution of the paper is to provide bounds for the throughput when stage parameters are arbitrary IID and NBUE (New Better than Used in Expectation) variables: the throughput is bounded from below by the exponential case and bounded from above by the deterministic case.
Type de document :
Communication dans un congrès
22nd Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010, Santorini, Greece. ACM, pp.166-175, 2010, 〈10.1145/1810479.1810511〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00788889
Contributeur : Arnaud Legrand <>
Soumis le : vendredi 15 février 2013 - 13:11:31
Dernière modification le : vendredi 20 avril 2018 - 15:44:24

Lien texte intégral

Identifiants

Citation

Anne Benoit, Fanny Dufossé, Matthieu Gallet, Bruno Gaujal, Yves Robert. Computing the throughput of probabilistic and replicated streaming applications. 22nd Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010, Santorini, Greece. ACM, pp.166-175, 2010, 〈10.1145/1810479.1810511〉. 〈hal-00788889〉

Partager

Métriques

Consultations de la notice

310