Skip to Main content Skip to Navigation

Computing the throughput of probabilistic and replicated streaming applications

Anne Benoit 1, 2, * Matthieu Gallet 1, 2 Bruno Gaujal 3 Yves Robert 1, 2
* Corresponding author
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 I.I.D. (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 to compute the throughput when mapping parameters are constant or follow I.I.D. exponential laws. The second main contribution is to provide bounds for the throughput when stage parameters are arbitrary I.I.D. and N.B.U.E. (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.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Anne Benoit Connect in order to contact the contributor
Submitted on : Friday, January 14, 2011 - 3:45:31 PM
Last modification on : Tuesday, October 19, 2021 - 11:16:49 PM
Long-term archiving on: : Tuesday, November 6, 2012 - 11:35:25 AM


Files produced by the author(s)


  • HAL Id : inria-00555890, version 1



Anne Benoit, Matthieu Gallet, Bruno Gaujal, Yves Robert. Computing the throughput of probabilistic and replicated streaming applications. [Research Report] RR-7510, INRIA. 2011, pp.33. ⟨inria-00555890⟩



Les métriques sont temporairement indisponibles