Stochastic Model of Computer Systems Functioning with Accumulator Storage for Serving Groups
https://doi.org/10.55648/1998-6920-2024-18-1-40-47
Abstract
To assess the potential capabilities of computer systems, feasibility indicators for solving problems are used. These indicators characterize the quality of the systems taking into account reliability and parameters of incoming tasks. One of the modes of computer systems functioning is the task flow servicing mode. Due to the peculiarities of this mode, when analyzing the functioning of computer systems, they are considered as a stochastic object, which in turn is well studied by stochastic methods. The paper proposes a mathematical model for calculating feasibility indicators for solving tasks in servicing mode of task flow on computer systems with accumulator storage. The model is constructed within the framework of queuing theory. Analytical solutions for assessing the fullness of accumulator storage are obtained.
About the Authors
V. A. Pavsky
Kemerovo State University (KemSU)
Russian Federation
Russian Federation
Valery A. Pavsky, Dr. of Sci. (Engineering), Professor, Professor of Department of the General mathematics and informatics
К. V. Pavsky
Siberian State University of Telecommunications and Information Science (SibSUTIS);
Rzhanov Institute of Semiconductor Physics (ISP SB RAS)
Russian Federation
Russian Federation
Kiril V. Pavsky, Dr. of Sci. (Engineering), Assistant professor, Head of Computer Systems Laboratory, Rzhanov Institute of Semiconductor Physics Siberian Branch of Russian Academy of Sciences (ISP SB RAS); Professor of the Department of computer science, Siberian State University of Telecommunications and Information Science (SibSUTIS)
References
1. Horoshevskij V. G. Arhitektura vychislitel'nyh sistem [Architecture of computer systems]. Moscow, BMSTU, 2008. 520 p.
2. Gupta S., Patel T., Engelmann C., and Tiwari D. Failures in large scale systems: long-term measurement, analysis, and implications. SC '17: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Article no. 44, Denver, Colorado, 12 -17 November, 2017.
3. Schroeder В., Gibson G. A large-scale study of failures in high-performance computing systems. Proceedings of the International Conference on Dependable Systems and Networks (DSN2006), Philadelphia, PA, USA, 25-28 June, 2006, 10 р.
4. Horoshevskij V. G. Modeli analiza i organizacii funkcionirovanija bol'shemasshtabnyh raspredelennyh vychislitel'nyh sistem [Models of analysis and organization of large-scale distributed computer systems]. Jelektronnoe modelirovanie, Kiev, 2003, vol 25, no. 6.
5. Xie M., Dai Y. S., and Poh K. L. Computing system reliability: models and analysis. New York, Kluwer academic publishers, 2004.
6. Harchol-Balter M. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, 2013.
7. Klejnrok L. Teorija massovogo obsluzhivanija [Queuing theory]. Moscow, Mashinostroenie, 1979. 432 p.
8. Saati T. L. Jelementy teorii massovogo obsluzhivanija i ee prilozhenija [Elements of queuing theory and its applications]. Moscow, Knizhnyj dom «LIBROKOM», 2010. 520 p.
9. Pavskij K. V., Pavskij V. A. Model' dlja rascheta pokazatelej osushhestvimosti reshenija zadach na raspredelennyh vychislitel'nyh sistemah s nakopitelem [Model for realizability calculation of tasks solution on distributed computer systems with buffer]. Vestnik SibGUTI, 2014, vol. 4, pp.4-8.
10. Stepanov V. V. Kurs differencial'nyh uravnenij [Course of differential equations]. Moscow, Editorial URSS, 2006. 472 p.
11. Feller V. Vvedenie v teoriju verojatnostej i ee prilozhenija [An introduction to probability theory and its applications. Vol. 1]., Мoscow, « LIBROKOM», 2010. 528 p.
Review
For citations:
Pavsky V.A., Pavsky К.V. Stochastic Model of Computer Systems Functioning with Accumulator Storage for Serving Groups. The Herald of the Siberian State University of Telecommunications and Information Science. 2024;18(1):40-47. (In Russ.) https://doi.org/10.55648/1998-6920-2024-18-1-40-47
Views:
1049
Email this article 
