• Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system. Every process maintains...
    2 KB (272 words) - 09:17, 26 May 2023
  • algorithm Mutual exclusion Lamport's Distributed Mutual Exclusion Algorithm Naimi-Trehel's log(n) Algorithm Maekawa's Algorithm Raymond's Algorithm Ricart–Agrawala...
    72 KB (7,951 words) - 17:13, 5 June 2025
  • Thumbnail for Mutual exclusion
    waiting to achieve mutual exclusion. Examples include: Dekker's algorithm Peterson's algorithm Lamport's bakery algorithm Szymański's algorithm Taubenfeld's...
    18 KB (2,336 words) - 15:38, 21 August 2024
  • Thumbnail for Leslie Lamport
    algorithms to solve many fundamental problems in distributed systems, including: the Paxos algorithm for consensus, the bakery algorithm for mutual exclusion...
    18 KB (1,616 words) - 18:41, 27 April 2025
  • Ricart–Agrawala algorithm is an algorithm for mutual exclusion on a distributed system. This algorithm is an extension and optimization of Lamport's Distributed Mutual...
    3 KB (427 words) - 19:26, 15 November 2024
  • Naimi–Trehel algorithm is an algorithm for achieving mutual exclusion in a distributed system. Unlike Lamport's distributed mutual exclusion algorithm and its...
    886 bytes (94 words) - 12:36, 30 June 2023
  • Maekawa's algorithm is an algorithm for mutual exclusion on a distributed system. The basis of this algorithm is a quorum-like approach where any one...
    5 KB (798 words) - 04:11, 18 May 2025
  • This algorithm is an extension and optimization of Lamport's Distributed Mutual Exclusion Algorithm. Agrawala received B.E. and M.E. degrees in Electrical...
    8 KB (833 words) - 10:49, 21 March 2025
  • Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on distributed resources...
    2 KB (359 words) - 09:58, 17 November 2022
  • allows one to design algorithms for mutual exclusion, and tasks like debugging or optimising distributed systems. In distributed systems, the happened-before...
    5 KB (744 words) - 19:34, 2 June 2025
  • The Suzuki–Kasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems. The process holding the token is the only...
    5 KB (767 words) - 17:23, 10 May 2025
  • presentation of self-stabilizing mutual exclusion algorithms. It also showed the first self-stabilizing algorithms that did not rely on strong assumptions...
    17 KB (2,259 words) - 18:56, 23 August 2024
  • Shared snapshot objects (category Distributed algorithms)
    annual ACM symposium on Theory of computing. pp. 86–88. Lamport, Leslie (1988). "The mutual exclusion problem: partII—statement and solutions". Journal of...
    25 KB (3,328 words) - 04:51, 18 November 2024
  • Thumbnail for TLA+
    programs. Leslie Lamport became interested in the problem after peer review found an error in a paper he submitted on mutual exclusion. Ed Ashcroft introduced...
    40 KB (4,068 words) - 05:27, 17 January 2025
  • concurrent algorithms started in the 1960s, with Dijkstra (1965) credited with being the first paper in this field, identifying and solving mutual exclusion. Concurrency...
    29 KB (3,004 words) - 17:17, 16 April 2025
  • computations, 1980 Peterson, G.L., Myths about the mutual exclusion problem, 1981 Crochemore, M., An optimal algorithm for computing the repetitions in a word,...
    5 KB (520 words) - 10:20, 14 March 2025
  • Michel Raynal (category Researchers in distributed computing)
    scheme for token- and tree-based distributed mutual exclusion algorithms" (PDF). IEEE Transactions on Parallel and Distributed Systems. 5 (11): 1185–1196....
    17 KB (1,499 words) - 06:28, 11 January 2024
  • Thumbnail for Model checking
    appear coarse, may, in fact, be sufficient to prove e.g. properties of mutual exclusion. Counterexample-guided abstraction refinement (CEGAR) begins checking...
    25 KB (2,788 words) - 21:41, 19 June 2025