Journal ArticleOPEN ACCESS

A fair share scheduler

Communications of the ACM (1988) 31(1) 44-55
DOI: 10.1145/35043.35047
145Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

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. © 1988, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Kay, J., & Lauder, P. (1988). A fair share scheduler. Communications of the ACM, 31(1), 44–55. https://doi.org/10.1145/35043.35047

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free