Queueing models of multiprogrammed computer systems with a multilevel memory hierarchy

A collection of queueing network models with distinguishable tasks in the system is developed and solved to represent various aspects of a multiprogrammed computer system. The basic model is a closed queuing network which models a system with a multilevel memory hierarchy with distinguishable tasks in the system. Equations which describe the behavior of the system are solved analytically. Using the solution of these equations, various performance measures - processor utilization, queue lengths, rate of task execution, expressions for system overhead, and effective CPU utilization - are developed. The basic model is altered to reflect the presence of jobs which access the system through terminals and are swapped in and out of memory. Again, the equations which describe the behavior of the system are solved analytically and expression for the percentage of time that the CPU is processing a swapped job is obtained