A fair share scheduler

  • Authors:
  • J. Kay;P. Lauder

  • Affiliations:
  • Univ. of Sydney, Sydney, N.S.W., Australia;Univ. of Sydney, Sydney, N.S.W., Australia

  • Venue:
  • Communications of the ACM
  • Year:
  • 1988

Quantified Score

Hi-index 48.23

Visualization

Abstract

Central-processing-unit schedulers have traditionally allocated resources fairly among processes. By contrast, a fair Share scheduler allocates resources so that users get their fair machine share over a long period.