Efficient and cost-aware operator placement in heterogeneous stream-processing environments

Authors:
Michael Daum;Frank Lauterwald;Philipp Baumgärtel;Niko Pollner;Klaus Meyer-Wegener
Affiliations:
University of Erlangen-Nürnberg, Erlangen, Germany;University of Erlangen-Nürnberg, Erlangen, Germany;University of Erlangen-Nürnberg, Erlangen, Germany;University of Erlangen-Nürnberg, Erlangen, Germany;University of Erlangen-Nürnberg, Erlangen, Germany
Venue:
Proceedings of the 5th ACM international conference on Distributed event-based system
Year:
2011

Citing 1
Cited 1

A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Data Stream Application Manager (DSAM)

Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Operator placement for distributed stream-processing systems is still a challenging problem that can be modeled as a Task Assignment Problem (TAP). Multiple objectives are relevant for the optimization in heterogeneous stream-processing systems as there are different capabilities of the underlying networks and stream-processing nodes. We present an approach based on linear programming relaxation and iterative deterministic rounding. It uses an efficient linearization approach for the quadratic objective function that results from the TAP.