Why does something as simple as reading the time become a hard problem for distributed systems? ✦ AI generated
Operations relying on correct ordering, like authorization checks, can act on stale data when clocks disagree.
Author: An operation that depends on a correct order, such as granting access only after the change that authorized it, can act on stale information.
explains mechanism · 3gives example · 1
Clock skew can cause a later write to be discarded in favor of an earlier one, silently losing the newer data.
Author: An update that happened later can be discarded in favor of an earlier one, because clock differences gave the earlier write the larger timestamp, and the newer data disappears with no error raised.
explains mechanism · 4
Hardware clocks drift apart, and NTP synchronization can reduce but never eliminate the misalignment.
Author: Each machine can read time from its own hardware clock, but those clocks do not stay aligned. Network Time Protocol (NTP) tries to bring the clocks together, but it cannot eliminate the problem.
explains mechanism · 1
Ordering events by timestamps across machines is fragile: a small clock skew in the wrong direction silently produces wrong results.
Author: If events on different machines are ordered by comparing timestamps, a small difference in the wrong direction can change the result.
explains mechanism · 2
Distributed logs can show an effect before its cause due to clock skew, complicating debugging.
Author: Logs gathered from several machines can place an effect before its cause, which makes tracing a problem much harder.
explains mechanism · 3
A single machine has one clock for ordering events, but distributed systems lack a shared reference, making ordering inherently problematic.
Author: On a single computer, every event can be measured against one clock, so the order of the events is never in doubt. However, a distributed system, where work is spread across many independent machines, lacks a shared reference.