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

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.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00424049
Contributor : Frédéric Vivien <>
Submitted on : Tuesday, October 13, 2009 - 8:26:10 PM
Last modification on : Thursday, August 1, 2019 - 10:42:20 AM
Long-term archiving on : Tuesday, October 16, 2012 - 12:12:05 PM

File

Heteropar09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00424049, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

528

Files downloads

349