An approximation technique for central server queueing models with a priority dispatching rule

Abstract

An approximation technique to solve central server queueing models with a priority dispatching rule is described in this paper. This technique reduces the problem size by aggregating I/O activities and combining different classes into a smaller number of classes, so that the reduced problem can be solved numerical examples considered, throughputs and mean CPU queue sizes calculated by the approximation differ from simulation results by less than 15 percent. © 1983.