An Analysis of Rabin's Randomized Mutual Exclusion Algorithm: Preliminary Report
In 1982, Michael Rabin published a randomized distributed algorithm implementing mutual exclusion for n processes using a read-modify-write primitive on a shared variable with O(log n) values. He claimed that this algorithm satisfied the following informally-stated strong probabilistic no-lockout pr...
Main Authors: | Lynch, Nancy A., Saias, Isaac |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149188 |
Similar Items
-
An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion
by: Fan, Rui, et al.
Published: (2008) -
Correctness proofs of the Peterson-Fischer mutual exclusion algorithms
by: Colby, Christopher P
Published: (2013) -
The Mutual Exclusion Problem for Unreliable Processes
by: Rivest, Ronald L., et al.
Published: (2023) -
Randomness Versus Non-Determinism in Distributed Computing
by: Saias, Alain Isaac
Published: (2023) -
Randomness versus non-determinism in distributed computing
by: Saias, Alain Isaac
Published: (2007)