Synchronization in Distributed Programs
- 1 April 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 4 (2) , 125-148
- https://doi.org/10.1145/357162.357163
Abstract
A technique for solving synchronization problems in distributed programs is described. Use of this technique in environments in which processes may fail is discussed. The technique can be used to solve synchronization problems directly, to implement new synchronization mechanisms (which are presumably well suited for use in distributed programs), and to construct distributed versions of existing synchronization mechanisms. Use of the technique is illustrated with implementations of distributed semaphores and a conditional message-passing facility.Keywords
This publication has 9 references indexed in Scilit:
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Output Guards and Nondeterminism in “Communicating Sequential Processes”ACM Transactions on Programming Languages and Systems, 1980
- Communication and Synchronization in Distributed SystemsIEEE Transactions on Software Engineering, 1979
- Preliminary Ada reference manualACM SIGPLAN Notices, 1979
- Synchronization with eventcounts and sequencersCommunications of the ACM, 1979
- Communicating sequential processesCommunications of the ACM, 1978
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Consistency and correctness of duplicate database systemsPublished by Association for Computing Machinery (ACM) ,1977
- EthernetCommunications of the ACM, 1976