A Survey of Analytical Time-Sharing Models.

Queueing models of time-sharing algorithms have been appearing in the literature with increasing frequency. This survey delineates the parameters which distinguish the different analytic models and presents the research results of most of the papers to date. The techniques used in analyzing various round-robin models and multiple-level queue models both with and without priorities are emphasized. The results indicated provide the system designer with a number of degrees of freedom with which to synthesize a time-shared processing system and point out needed research directions. An annotated bibliography is provided. [ABSTRACT FROM AUTHOR]