Semaphores for fair scheduling monitor conditions

Authors:
Neil Dunstan
Affiliations:
Department of Mathematics, Statistics and Computing Science, University of New England, Armidale, NSW, 2351, Australia
Venue:
ACM SIGOPS Operating Systems Review
Year:
1991

Citing 4
Cited 1

Operating system concepts (2nd ed.)

Operating system concepts (2nd ed.)
The Turing programming language

Communications of the ACM
Monitors: an operating system structuring concept

Communications of the ACM
Advanced UNIX Programming

Advanced UNIX Programming

Semaphores revisited with MMS

ACM SIGOPS Operating Systems Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although semaphores provide an adequate means to represent monitor condition variables, enhancements are necessary when fair scheduling is required. In this context, fair scheduling means that a process which waits on a condition is released before any subsequent processes which wait on the condition. Two solutions are shown which utilize enhanced forms of semaphores.