A CONTINUUM OF COMPUTER PROCESSOR·SHARING aUEUEING MODELS

This paper is concerned with the response time provided to jobs in a time-shared computer systems environment. The main thrust of this paper is to extend all known results and any future results for such scheduling algorithms so as to create a continuum of response time functions by introducing a single degree ' of freedom into our model. Thus, given any scheduling algorithm, its performance may be made to vary continuously from its original form to that of the first-co~e-first-served scheduling algorithm by means of this degree of freedom. The solution for this continuum is simply expressed in terms of the solution for the original scheduling algorithm and the implementation of this degree of freedom in any computer system is extremely simple. The class of queueing systems consid-ered is of the M/G/l type