Devantirezover 10 years ago
The binary search of distributed programming
8 min read
Martin Kleppmann analyzed generating monotonically increasing IDs with Redis. The problem requires ensuring each ID is always greater than all past IDs and never duplicated. This safety property must hold under all conditions, making the task more complex than it initially appears.
Level
Hype check
Tap to vote and see what everyone thinks.