Synchronization primitives for a multiprocessor: a formal specification
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Delay-Independent Design for Distributed Systems
IEEE Transactions on Software Engineering
File placement and process assignment due to resource sharing in a distributed system
WSC '85 Proceedings of the 17th conference on Winter simulation
Survey of recent operating systems research, designs and implementations
ACM SIGOPS Operating Systems Review
Distributed file systems - a survey
ACM SIGOPS Operating Systems Review
Performance-reliability issues in distributed file systems
Journal of Systems and Software
| Hi-index | 0.00 |
The design of computer systems to be concurrently used by multiple, independent users requires a mechanism that allows programs to synchronize their use of shared resources. Many such mechanisms have been developed and used in practical applications. Most of the currently favored mechanisms, such as semaphores and monitors are based on the concept of mutual exclusion. In this paper, we describe an alternative synchronization mechanism that is not based on the concept of mutual exclusion, but rather on observing the sequencing of significant events in the course of an asynchronous computation. Two kinds of objects are described, an eventcount, which is a communication path for signalling and observing the progress of concurrent computations, and a sequencer, which assigns an order to events occurring in the system.