Resource allocation strategies for constructive in-network stream processing

Abstract : We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuously updated at various locations in a network. Examples of in-network stream processing include the processing of data in a sensor network, or of continuous queries on distributed relational databases. Our aim is to provide the user a set of processors that should be bought or rented in order to ensure that the application achieves a minimum steady-state throughput, and with the objective of minimizing platform cost. We prove that even the simplest variant of the problem is NP-hard, and we design several polynomial time heuristics, which are evaluated via extensive simulations and compared to theoretical bounds.
Type de document :
Communication dans un congrès
11th Workshop on Advances in Parallel and Distributed Computational Models, May 2009, Rome, Italy. 2009, 〈http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=5160874〉. 〈10.1109/IPDPS.2009.5160874〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00422656
Contributeur : Frédéric Vivien <>
Soumis le : jeudi 8 octobre 2009 - 11:55:49
Dernière modification le : vendredi 20 avril 2018 - 15:44:23
Document(s) archivé(s) le : mercredi 16 juin 2010 - 00:29:38

Fichier

APDCM09.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

Citation

Anne Benoit, Henri Casanova, Veronika Rehn, Yves Robert. Resource allocation strategies for constructive in-network stream processing. 11th Workshop on Advances in Parallel and Distributed Computational Models, May 2009, Rome, Italy. 2009, 〈http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=5160874〉. 〈10.1109/IPDPS.2009.5160874〉. 〈inria-00422656〉

Partager

Métriques

Consultations de la notice

563

Téléchargements de fichiers

146