Jump to content

Talk:Lamport's distributed mutual exclusion algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Qwerfjkl (bot) (talk | contribs) at 08:12, 1 February 2024 (Implementing WP:PIQA (Task 26)). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Assumptions are missing: I think you need a direct FIFO connection between each pair of proccesses, otherwise the described algorithm might fail.

Merge into Lamport's bakery algorithm

[edit]

Am I correct in that this is basically a distributed version of Lamport's bakery algorithm? Should they be separate, since they are basically the same algorithm with a slight variation to work in a distributed system? At least there should be clearer links between the two pages, indicating their relation. Sega381 (talk) 15:36, 31 October 2013 (UTC)[reply]