Distributed Mutual Exclusion on a Ring of Processes
- Creators
- Martin, Alain J.
Abstract
A set of processes called "masters" are sharing a critical section on a mutual exclusion basis. The servers communicate with each other in a ring. Three solutions for solving the mutual exclusion problem are presented. They all rely on the presence of a unique privilege in the ring. The notation used extends CSP input and output commands with a Boolean primitive, the "probe", which makes it possible to determine whether a communication action is pending on a channel. A master communicates only with its private "server". In the correctness proofs, the concept of "trace" is introduced, i.e. a total ordering of actions corresponding to a possible interleaving of the atomic actions of a concurrent computation. [Note: report includes the date April 83/October 83 but published in 1984]
Files
Name | Size | Download all |
---|---|---|
md5:c1ac604406b66b3244b9d0cb1082ecd0
|
842.9 kB | Preview Download |
md5:655407a8986ef545686e86f7b90ffd20
|
965.5 kB | Download |
Additional details
- Eprint ID
- 26992
- Resolver ID
- CaltechCSTR:1984.5080-tr-83
- Created
-
2002-08-07Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports