Scientific publications

The paper analyses the problem of optimal control of several parallel FIFO-queues located in two-level memory (for example, registers—random access memory). The probabilities of parallel operations with each queue are assumed to be known. Our task was to optimally partition the total fast memory between FIFO-queues and to determine for each queue in each partition the number of fast memory elements after redistributions, so that the mean time between queue redistributions is maximized. As optimality criteria for memory sharing, we consider the maximum sum of the average operating times of each queue before the memory is redistributed and the maximum shortest average operating time of each queue before the memory is redistributed. The mean time was calculated on the basis of a simulation model and on the basis of a model of an absorbing Markov chain.