A fair share scheduler
- 1 January 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 31 (1) , 44-55
- https://doi.org/10.1145/35043.35047
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.Keywords
This publication has 8 references indexed in Scilit:
- Computer Performance Evaluation MethodologyIEEE Transactions on Computers, 1984
- Principles of computer charging in a university-type organizationCommunications of the ACM, 1983
- Immediate turnround—an elusive goalSoftware: Practice and Experience, 1982
- Charging for Computing ResourcesACM Computing Surveys, 1979
- Scheduling for immediate turnroundSoftware: Practice and Experience, 1978
- Scheduling for a share of the machineSoftware: Practice and Experience, 1975
- The allocation of computer resources—is pricing the answer?Communications of the ACM, 1970
- A scheduling philosophy for multiprocessing systemsCommunications of the ACM, 1968