Model for performance analysis of distributed stream processing applications

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nowadays, a lot of data is produced every second and it needs to be processed immediately. Processing such unbounded streams of data is often applied in a distributed environment in order to achieve high throughput. There is a challenge to predict the performance-related characteristics of such applications. Knowledge of these properties is essential for decisions about the amount of needed computational resources, how the computations should be spread in the distributed environment, etc. In this paper, we propose a model to represent such streaming applications with the respect to their performance related properties.We present a conversion of the model to Colored Petri Nets (CPNs) which is used for performance analysis of the original application. The behavior of the proposed model and its conversion to the CPNs is validated through experiments. Our prediction was able to achieve nearly 100% precise maximum delays of real stream processing applications.

Cite

CITATION STYLE

APA

Nalepa, F., Batko, M., & Zezula, P. (2015). Model for performance analysis of distributed stream processing applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9262, pp. 520–533). Springer Verlag. https://doi.org/10.1007/978-3-319-22852-5_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free