Another solution of the mutual exclusion problem
Information Processing Letters
Algorithms for mutual exclusion
Algorithms for mutual exclusion
A new generalization of Dekker's algorithm for mutual exclusion
Information Processing Letters
Operation systems: advanced concepts
Operation systems: advanced concepts
The logical design of operating systems (2nd ed.)
The logical design of operating systems (2nd ed.)
Operating systems: concepts, policies, and mechanisms
Operating systems: concepts, policies, and mechanisms
Principles of operating systems
Principles of operating systems
Proof of a mutual exclusion algorithm—a classic example
ACM SIGOPS Operating Systems Review
Concurrent programming: principles and practice
Concurrent programming: principles and practice
Operating systems (3rd ed.): internals and design principles
Operating systems (3rd ed.): internals and design principles
Letters to the editor: go to statement considered harmful
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Principles of Concurrent Programming
Principles of Concurrent Programming
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Operating systems
Specifying and Verifying Event-Based Fairness Enhanced Systems
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Dekker's algorithm[9] is the historically first software solution to mutual exclusion problem for 2-process case. The first software solution for n-process case was subsequently proposed by Dijkstra[8]. These two algorithms have become de facto examples of mutual exclusion algorithms, for their historical importance. Since the publication of Dijkstra's algorithm, there have been many solutions proposed in the literature [24, 1, 2]. In that, Peterson's algorithm [21] is one among the very popular algorithms. Peterson's algorithm has been extensively analyzed for its elegance and compactness. This paper attempts to dispel the myths about some of the properties of these three remarkable algorithms, by a systematic analysis.