1. Calculation of indices of the realizability of solving tasks on computer systems in group servicing.
- Author
-
Pavsky, K. and Pavsky, V.
- Subjects
- *
COMPUTER systems , *QUEUING theory , *SYSTEM failures , *COMPUTER simulation , *SUPERCOMPUTERS , *ANALYTICAL solutions - Abstract
To assess the potential capabilities of computer systems (CS), indices of the realizability of solving tasks are used. These indices characterize the quality of the systems, taking into account the reliability of the CS and the parameters of the tasks. These estimates become relevant when scalable computer systems are considered. For example, 93% of the TOP 500 supercomputers are cluster-type systems that are scalable. Failures in such systems, which directly depend on the number of computing nodes, significantly reduce the efficiency of solving tasks. The paper presents a description of mathematical model of computer systems with accumulator in group servicing task flow. The mathematical model is based on the methods of queuing theory. The paper offers solutions for calculating indices that allow us to assess the fullness of the accumulator and understand how the size of the group affects the fullness of the one. The obtained analytical solutions are aimed at express analysis of the functioning of CS. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF