A Survey of Analytical Time-Sharing Models

Abstract

ModelsQueueing models of t~me-sharing algortthms have been appearing in the literature with increasing frequency.This survey dehneates the parameters which dmtinguish the different analytic models and presents the research results of most of the papers to date.The techniques used m analyzing various round-robin models and multiple-level queue models both with and without priomhes are emphasized.The results indicated provide the system designer with a number of degrees of freedom with which to synthesize a t]me-shared processing system and point out needed research directions.An annotated bibliography is provided.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 95 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.