Resource allocation for multiple concurrent in-network stream-processing applications

  • Authors:
  • Anne Benoit;Henri Casanova;Veronika Rehn-Sonigo;Yves Robert

  • Affiliations:
  • LIP, ENS Lyon, Lyon Cedex 07, France;University of Hawai'i at Manoa, Honolulu, HI;LIP, ENS Lyon, Lyon Cedex 07, France;LIP, ENS Lyon, Lyon Cedex 07, France

  • Venue:
  • Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the operator mapping problem for in-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 processors, and allows us to identify a heuristic that achieves good results in practice.