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.
Type de document :
[Research Report] RR-6864, INRIA. 2009
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger
Contributeur : Veronika Rehn-Sonigo <>
Soumis le : mardi 3 mars 2009 - 18:19:23
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : jeudi 30 juin 2011 - 11:05:16


Fichiers produits par l'(les) auteur(s)


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



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〉



Consultations de la notice


Téléchargements de fichiers