Published 1989
| Version public
Book Section - Chapter
Design of Synchronization Algorithms
-
1.
California Institute of Technology
-
2.
University of Groningen
Contributors
Other:
Abstract
In these notes we discuss the design of concurrent programs that consist of a set of communicating sequential processes. The processes communicate via shared variables and synchronize via semaphores. We present an axiomatic definition of semaphores, and prove properties about them. The split binary semaphore is introduced and it is shown how it can be used in constructing the synchronization part of concurrent processes in order to maintain a given synchronization condition.
Additional Information
© Springer-Verlag Berlin Heidelberg 1989. These notes are a compilation of the chapters on semaphores from a draft text on concurrent computations. The draft was written mainly while the second author was visiting at the California Institute of Technology. The research described was partly sponsored by the Defense Advanced Research Projects Agency, DARPA Order numbers 3771 & 6202, and monitored by the Office of Naval Research under contract numbers N00014-79-C-0597 & N000l4-87-K-0745.Additional details
Identifiers
- Eprint ID
- 105938
- Resolver ID
- CaltechAUTHORS:20201008-131242613
Funding
- Defense Advanced Research Projects Agency (DARPA)
- 3771
- Defense Advanced Research Projects Agency (DARPA)
- 6202
- Office of Naval Research (ONR)
- N00014-79-C-0597
- Office of Naval Research (ONR)
- N000l4-87-K-0745
Dates
- Created
-
2020-10-08Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field
Caltech Custom Metadata
- Series Name
- NATO ASI Series. Series F
- Series Volume or Issue Number
- 55