Resource Allocation for Multiple Concurrent In-Network Stream-Processing Applications - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Resource Allocation for Multiple Concurrent In-Network Stream-Processing Applications

(1) , (2) , (1) , (1)
1
2
Anne Benoit
Henri Casanova
  • Function : Author
  • PersonId : 841811
Yves Robert

Abstract

This paper investigates the operator mapping problem for in-network stream-processing applications. In-network stream-processing amounts to applying one or more trees of operators in steady-state, to multiple data objects that are continuously updated at different locations in the network. The goal is to compute some final data at some desired rate. Different operator trees may share common subtrees. Therefore, it may be possible to reuse some intermediate results in different application trees. The first contribution of this work is to provide complexity results for different instances of the basic problem, as well as integer linear program formulations of various problem instances. The second second contribution is the design of several polynomial-time heuristics. One of the primary objectives of these heuristics is to reuse intermediate results shared by multiple applications. Our quantitative comparisons of these heuristics in simulation demonstrates the importance of choosing appropriate processors for operator mapping. It also allow us to identify a heuristic that achieves good results in practice.
Fichier principal
Vignette du fichier
RR2009-07.pdf (438.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : ensl-00365490 , version 1

Cite

Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo, Yves Robert. Resource Allocation for Multiple Concurrent In-Network Stream-Processing Applications. 2009. ⟨ensl-00365490⟩
129 View
139 Download

Share

Gmail Facebook Twitter LinkedIn More