coordination
Distributed Lock
Mutual exclusion across nodes — only one can hold the lock at a time. Others queue.
lock statusFREE
queue length0
⭕
Node-A
idle
⭕
Node-B
idle
⭕
Node-C
idle
Click a node to request lock
// event log
No events yet
How It Works
- Lock can be held by at most one node
- Other nodes requesting the lock are queued (FIFO)
- On release, lock transfers to next waiting node
- Prevents race conditions in distributed systems
Use Cases
- Leader election coordination
- Critical section protection
- Distributed transaction control
- Resource access serialization