Computing the throughput of replicated workflows on heterogeneous platforms - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Computing the throughput of replicated workflows on heterogeneous platforms

(1, 2) , (2, 1) , (3) , (2, 1)
1
2
3

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.

Dates and versions

hal-00788928 , version 1 (15-02-2013)

Identifiers

Cite

Anne Benoit, Matthieu Gallet, Bruno Gaujal, Yves Robert. Computing the throughput of replicated workflows on heterogeneous platforms. Int. conf. on Parallel Processing, ICPP, 2009, Vienna, Austria. pp.204-211, ⟨10.1109/ICPP.2009.41⟩. ⟨hal-00788928⟩
145 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More