Lamport's bakery algorithm got mutual exclusion without a shared clock in 1974

Popularity Index: 1 Updated at 2026-10-17 09:36 UTC

Sites

Related Topics

Clock skew of a few milliseconds is enough to reorder your bank transfers Last write wins silently deletes writes when two replicas share a timestamp Dynamo's version vectors produced sibling objects that the application had to merge by hand Spanner's TrueTime buys causality with atomic clocks and an explicit uncertainty window Vector clocks detect concurrency but the vector grows with every node that touches the data There is no global now in a distributed system and NTP cannot manufacture one Why testing causal ordering needs deterministic simulation and not a staging cluster Hybrid logical clocks keep physical time but carry a counter to survive a backwards jump Version vectors in CRDTs are vector clocks with a different bookkeeping job Pruning a vector clock is a lossy decision that can reintroduce false conflicts

Hot Categories

Featured Categories