Semaphores outside the kernel

Authors:
Jason Gait
Affiliations:
Computer Research Laboratory, Tektronix, Inc., Beaverton, Oregon
Venue:
ACM SIGPLAN Notices
Year:
1984

Citing 9
Cited 2

Operating system design: the XINU approach

Operating system design: the XINU approach
Fundamentals of operating systems (3rd ed.)

Fundamentals of operating systems (3rd ed.)
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Communicating sequential processes

Communications of the ACM
Distributed processes: a concurrent programming concept

Communications of the ACM
Additional comments on a problem in concurrent programming control

Communications of the ACM
Solution of a problem in concurrent programming control

Communications of the ACM
Software Engineering: Analysis and Verification

Software Engineering: Analysis and Verification
Experience with processes and monitors in Mesa (Summary)

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles

Adapting UNIX for a multiprocessor environment

Communications of the ACM
A conditional critical region pre-processor for C based on the Owicki and Gries scheme

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present three new implementations of semaphores for V7 UNIX. None require kernel modifications. The canonical UNIX semaphore method uses link O in a spin loop. The first new method replaces the canonical spin loop with a software trap mechanism, the second provides additional enhancements in the form of a pool of semaphores and explicit quene management, and the third is a distributed protocol extending to the ability for synchronizing in network environments.