A closed queueing network model with state dependent routing probabilities is developed for the study of interactive computing systems which use swapping as a memory managmnent strategy. An algorithm to obtain an approximate solution of the mathematical model is proposed. Based on meamuements of a dual-processor PDP-10 system, the model is found to be better in predicting the system performance than the classical model without state dependent routing probabilities.
Chen, P. P. S. (1975). Queueing network model of interactive computing systems. Proceedings of the IEEE. https://doi.org/10.1109/proc.1975.9860
Imported from OpenAlex (CC0) — nothing here is generated.