Algorithms for mutual exclusion
Algorithms for mutual exclusion
Proof of a mutual exclusion algorithm—a classic example
ACM SIGOPS Operating Systems Review
A more efficient generalization of Peterson's mutual exclusion algorithm
Information Processing Letters
Peterson's mutual exclusion algorithm revisited
Science of Computer Programming
Solution of a problem in concurrent programming control
Communications of the ACM
A simple group mutual l-exclusion algorithm
Information Processing Letters
Deriving a Scalable Algorithm for Mutual Exclusion
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
| Hi-index | 0.89 |
Peterson's algorithm [G.L. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115-116] for mutual exclusion has been widely studied for its elegance and simplicity. In Peterson's algorithm, each process has to cross n - 1 stages to access the shared resource irrespective of the contention for the shared resource at that time, and allows unbounded bypasses. In [K. Block, T.-K. Woo, A more efficient generalization of Peterson's mutual exclusion algorithm, Inform. Process. Lett. 35 (1990) 219-222], Block and Woo proposed a modified algorithm that transforms the number stages to be crossed from fixed n - 1 to t, where 1 ≤ t ≤ n, and bounds the number of possible bypasses by n(n - 1)/2. This paper proposes a simple modification that reduces the bound on the number of possible bypasses to optimal n - 1.