Resource Allocation for Multiple Concurrent In-Network Stream-Processing Applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

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

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
RR-6864.pdf (397.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00365514 , version 1 (03-03-2009)

Identifiers

  • HAL Id : inria-00365514 , version 1
  • ARXIV : 0903.0710

Cite

Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo, Yves Robert. Resource Allocation for Multiple Concurrent In-Network Stream-Processing Applications. [Research Report] RR-6864, INRIA. 2009. ⟨inria-00365514⟩
167 View
203 Download

Altmetric

Share

Gmail Facebook X LinkedIn More