Jump to content
Wikipedia The Free Encyclopedia

Talk:Lamport's distributed mutual exclusion algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article has not yet been rated on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
WikiProject icon Computer science
WikiProject icon This article is within the scope of WikiProject Computer science , a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
??? This article has not yet received a rating on the project's importance scale.
Things you can help WikiProject Computer science with:
It is requested that a diagram or diagrams be included in this article to improve its quality. Specific illustrations, plots, or diagrams can be requested at the Graphic Lab. Please replace this template with a more specific media request template where possible.
For more information, refer to discussion on this page and/or the listing at Wikipedia:Requested images.

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 ]

AltStyle によって変換されたページ (->オリジナル) /