Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2008-07-10
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
In this paper we consider the operator mapping problem for in-network stream processing applications. In-network stream processing consists in applying a tree of operators in steady-state to multiple data objects that are continually updated at various locations on 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. We study the operator mapping problem in a ``constructive'' scenario, i.e., a scenario in which one builds a platform dedicated to the application buy purchasing processing servers with various costs and capabilities. The objective is to minimize the cost of the platform while ensuring that the application achieves a minimum steady-state throughput. The first contribution of this paper is the formalization of a set of relevant operator-placement problems as linear programs, and a proof that even simple versions of the problem are NP-complete. Our second contribution is the design of several polynomial time heuristics, which are evaluated via extensive simulations and compared to theoretical bounds for optimal solutions.
Benoit Anne
Casanova Henri
Rehn-Sonigo Veronika
Robert Yves
No associations
LandOfFree
Resource Allocation Strategies for In-Network Stream Processing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Resource Allocation Strategies for In-Network Stream Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Resource Allocation Strategies for In-Network Stream Processing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-460254