%0 Conference Paper %1 QinEichelberger16 %A Qin, Cui %A Eichelberger, Holger %B Proceedings of the Workshops of the EDBT/ICDT 2016 Joint Conference, EDBT/ICDT Workshops 2016, Bordeaux, France, March 15, 2016. %D 2016 %I CEUR-WS.org %K adaptation myown qualimaster %T Impact-minimizing Runtime Switching of Distributed Stream Processing Algorithms %U http://ceur-ws.org/Vol-1558/paper2.pdf %X Stream processing is a popular paradigm to process huge amounts of data. During processing, the actual characteristics of the analyzed data streams may vary, e.g., in terms of volume or velocity. To provide a steady quality of the analysis results, runtime adaptation of the data processing is desirable. While several techniques for changing data stream processing at runtime do exist, one specific challenge is to minimize the impact of runtime adaptation on the data processing, in particular for real-time data analytics. In this paper, we focus on the runtime switching among alternative distributed algorithms as a means for adapting complex data stream processing tasks. We present an approach, which combines stream re-routing with buffering and stream synchronization to reduce the impact on the data streams. Finally, we analyze and discuss our approach in terms of a quantitative evaluation.

@inproceedings{QinEichelberger16, abstract = {Stream processing is a popular paradigm to process huge amounts of data. During processing, the actual characteristics of the analyzed data streams may vary, e.g., in terms of volume or velocity. To provide a steady quality of the analysis results, runtime adaptation of the data processing is desirable. While several techniques for changing data stream processing at runtime do exist, one specific challenge is to minimize the impact of runtime adaptation on the data processing, in particular for real-time data analytics. In this paper, we focus on the runtime switching among alternative distributed algorithms as a means for adapting complex data stream processing tasks. We present an approach, which combines stream re-routing with buffering and stream synchronization to reduce the impact on the data streams. Finally, we analyze and discuss our approach in terms of a quantitative evaluation.}, added-at = {2016-04-08T14:23:54.000+0200}, author = {Qin, Cui and Eichelberger, Holger}, bibsource = {dblp computer science bibliography, http://dblp.org}, biburl = {https://www.bibsonomy.org/bibtex/2cda4c68fedefba7a21b04bc934970ff0/eichelbe}, booktitle = {Proceedings of the Workshops of the {EDBT/ICDT} 2016 Joint Conference, {EDBT/ICDT} Workshops 2016, Bordeaux, France, March 15, 2016.}, interhash = {612cfa105775be502f5f9398de32a561}, intrahash = {cda4c68fedefba7a21b04bc934970ff0}, issn = {1613-0073}, keywords = {adaptation myown qualimaster}, month = mar, publisher = {CEUR-WS.org}, timestamp = {2016-04-08T14:23:54.000+0200}, title = {Impact-minimizing Runtime Switching of Distributed Stream Processing Algorithms}, url = {http://ceur-ws.org/Vol-1558/paper2.pdf}, year = 2016 }