Abstract
Nowadays, a lot of data are produced every second and they need to be processed immediately. Processing such unbounded streams of data is often run in a distributed environment in order to achieve high throughput. The challenge is the ability 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 present performance analysis of distributed stream processing applications using Colored Petri Nets (CPNs). We extend our previously proposed model with processing strategies which are used to specify performance effects when multiple tasks are placed on the same resource. We also show a detailed conversion of the whole proposed model to the CPNs. The conversion is validated through simulations of the CPNs which are compared to real streaming applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Apache Storm. https://storm.apache.org/
Benoit, A., Çatalyürek, Ü.V., Robert, Y., Saule, E.: A survey of pipelined workflow scheduling: models and algorithms. ACM Comput. Surv. (CSUR) 45(4), 50 (2013)
Bouillard, A., Phan, L.T., Chakraborty, S.: Lightweight modeling of complex state dependencies in stream processing systems. In: 15th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2009, pp. 195–204. IEEE (2009)
Chakraborty, S., Phan, L.T., Thiagarajan, P.: Event count automata: a state-based model for stream processing systems. In: 26th IEEE International Real-Time Systems Symposium, RTSS 2005, pp. 87–98. IEEE (2005)
Chakraborty, S., Thiele, L.: A new task model for streaming applications and its schedulability analysis. In: Proceedings of Design, Automation and Test in Europe, pp. 486–491. IEEE (2005)
Gottumukkala, R.N., Shepherd, M.D., Sun, T.: Validation and analysis of jdf workflows using colored petri nets, 8 June 2010. US Patent 7,734,492
Jensen, K., Kristensen, L.M.: Coloured Petri Nets: Modelling and Validation of Concurrent Systems. Springer, Heidelberg (2009)
Kristensen, L.M., Petrucci, L.: An approach to distributed state space exploration for coloured petri nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 474–483. Springer, Heidelberg (2004)
Nalepa, F., Batko, M., Zezula, P.: Model for performance analysis of distributed stream processing applications. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9262, pp. 520–533. Springer, Heidelberg (2015)
Rygielski, P., Kounev, S.: Data center network throughput analysis using queueing petri nets. In: 2014 IEEE 34th International Conference on Distributed Computing Systems Workshops (ICDCSW), pp. 100–105. IEEE (2014)
Wieczorek, M., Hoheisel, A., Prodan, R.: Towards a general model of the multi-criteria workflow scheduling on the grid. Future Gener. Comput. Syst. 25(3), 237–256 (2009)
Acknowledgements
This work was supported by the Czech national research project GBP103/12/G084. The hardware infrastructure was provided by the METACentrum under the programme LM 2010005.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Nalepa, F., Batko, M., Zezula, P. (2016). Performance Analysis of Distributed Stream Processing Applications Through Colored Petri Nets. In: Kofroň, J., Vojnar, T. (eds) Mathematical and Engineering Methods in Computer Science. MEMICS 2015. Lecture Notes in Computer Science(), vol 9548. Springer, Cham. https://doi.org/10.1007/978-3-319-29817-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-29817-7_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29816-0
Online ISBN: 978-3-319-29817-7
eBook Packages: Computer ScienceComputer Science (R0)