Answers are grounded in this paper and cite their sources.
A computer system consisting of several identical CPUs and several identical I/O units Is described The system works under light load conditions in a multlprogrammmg 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 Markovlan assumptions it is shown that the steady-state probablhty distribution is of matrixgeometric form. The stablhty condition is exphcltly 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
No takes yet. Share an insight, caveat, or question.
Guy Latouche (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: