Lamport's distributed mutual exclusion algorithm
GPTKB entity
Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:assumes |
asynchronous system
no process failures |
| gptkbp:category |
distributed systems
concurrency control |
| gptkbp:complexity |
O(n)
|
| gptkbp:describedBy |
gptkb:Time,_Clocks,_and_the_Ordering_of_Events_in_a_Distributed_System
|
| gptkbp:field |
computer science
distributed computing |
| gptkbp:guarantees |
mutual exclusion
no deadlock no starvation |
| https://www.w3.org/2000/01/rdf-schema#label |
Lamport's distributed mutual exclusion algorithm
|
| gptkbp:numberOfMessagesPerCriticalSectionEntry |
3(n-1)
|
| gptkbp:proposedBy |
gptkb:Leslie_Lamport
|
| gptkbp:publishedIn |
gptkb:Communications_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Ricart–Agrawala_algorithm
token ring algorithm |
| gptkbp:requires |
reliable message delivery
total ordering of events FIFO channels |
| gptkbp:solvedBy |
distributed mutual exclusion problem
|
| gptkbp:uses |
logical clocks
request, reply, release messages |
| gptkbp:yearProposed |
1978
|
| gptkbp:bfsParent |
gptkb:Ricart–Agrawala_algorithm
|
| gptkbp:bfsLayer |
8
|