Algorithmic Analysis of a Multiprogramming Multiprocessor Computer System.

摘要

A computer system consisting of several identical CPU and several identical I/O units is described. The system works under light load conditions in a multiprogramming mode. Programs belong either to an incoming queue, which may be empty, or to an inner loop if they are allowed access to the resources of the system. The maximum number of programs in the inner loop is finite. Under Markovian assumptions, it is shown that the steady-state probability distribution is of matrix-geometric form. The stability condition is explicitly given. For stable systems, it is shown how the stationary probability distribution, the virtual waiting time in the incoming queue and other features of interest may be computed. (Author)