Abstract :
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.
