Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Frédéric Vivien Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2009 - 8:26:10 PM
Last modification on : Tuesday, October 19, 2021 - 11:54:55 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 12:12:05 PM


Files produced by the author(s)


  • HAL Id : inria-00424049, version 1



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⟩



Record views


Files downloads