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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call