Approximating Pre-emptive Priority Dispatching in a Multiprogramming Model

The formulation of the closed queuing network model of a multiprogramming computer system is generalized to allow each task to have its own set of facility service rates and I/O device selection probability distribution. In the model, processor sharing is assumed for different types of customers. It is shown through a series of investigations that the model reasonably approximates pre-emptive priority dispatching.