Skip to Main Content
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.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.