Waiting Time Distributions for Processor-Sharing Systems

Abstract

A basic probability model that has arisen in the study of time-shared or multiprogrammed systems is the so-called processor-sharing model. Ill this model it is assumed that the processor is shared simultaneously by each unit in the system (e.g. job or program in comput er systems, or message in communication systems). In particular, if there are n units in the system, then any given unit is being processed at a rate which is (1/n)-th the rate at which it would be processed if it had the system to itself.