Resource Allocation for Multiple Concurrent In-network Stream-processing Applications - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Resource Allocation for Multiple Concurrent In-network Stream-processing Applications

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

Abstract

Thispaperinvestigatestheoperatormappingproblemforin- network stream-processing applications. In-network stream-processing is the application of one or several trees of operators, in steady-state, to data that are continuously updated at different locations in the network. The goal is to generate final results at a desired rate. Different operator trees may share common subtrees, so that intermediate results could be reused in different applications. This work provides complexity results for different instances of the basic problem and proposes several polynomial- time heuristics. Quantitative comparison of the heuristics in simulation demonstrates the importance of mapping operators to appropriate pro- cessors, and allows us to identify a heuristic that achieves good results in practice.
Fichier principal
Vignette du fichier
Heteropar09.pdf (142.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00424049 , version 1 (13-10-2009)

Identifiers

  • HAL Id : inria-00424049 , version 1

Cite

Anne Benoit, Henri Casanova, Veronika Rehn, Yves Robert. Resource Allocation for Multiple Concurrent In-network Stream-processing Applications. Seventh International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms, Aug 2009, Delft, Netherlands. ⟨inria-00424049⟩
303 View
148 Download

Share

Gmail Facebook Twitter LinkedIn More