Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system.
Requesting process Other processes This algorithm creates 3(N − 1) messages per request, or (N − 1) messages and 2 broadcasts.
3(N − 1) messages per request includes: This algorithm has several disadvantages.
They are: This computer science article is a stub.
You can help Wikipedia by expanding it.