Models of Pure time-sharing disciplines for resource allocation

  • Authors:

  • E. G. Coffman, Jr.;R. R. Muntz

  • Affiliations:

  • -;-

  • Venue:
  • ACM '69 Proceedings of the 1969 24th national conference
  • Year:
  • 1969

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pure time sharing (PTS) disciplines are those which involve in some way the simultaneous sharing of a processor or other service facility by more than one job at a time. Implicit is the requirement that the total processor capacity is fixed so that individual job processing rates are reduced according as the number of jobs sharing the processor increases. In this paper the general class of such disciplines is surveyed and studied by the investigation of the behavior of mathematical models. By the introduction of appropriate algorithms it is shown how these disciplines can be applied to static processor scheduling problems in which total schedule time is to be minimized. Application of these disciplines to queueing systems is also examined, yielding characterizations which classify the performance measures optimized. The PTS disciplines discussed include one which bases scheduling decisions on the elapsed times of jobs and one which bases decisions on the expected remaining processing times of jobs. The simplest PTS discipline studied is one which makes no explicit use of any processing time information.