Computing the throughput of replicated workflows on heterogeneous platforms - ENS de Lyon - École normale supérieure de Lyon Access content directly
Preprints, Working Papers, ... Year :

Computing the throughput of replicated workflows on heterogeneous platforms

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.
Fichier principal
Vignette du fichier
RR-2009-08.lip.pdf (731.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00365522 , version 1 (03-03-2009)

Identifiers

  • HAL Id : ensl-00365522 , version 1

Cite

Matthieu Gallet, Anne Benoit, Yves Robert, Bruno Gaujal. Computing the throughput of replicated workflows on heterogeneous platforms. 2009. ⟨ensl-00365522⟩
216 View
343 Download

Share

Gmail Facebook Twitter LinkedIn More