Synthesized answer
The provided passages do not contain information about the inherent limitations of physical clock synchronization or how logical clocks and the "happens-before" relation offer a more robust solution. Therefore, I cannot answer the question.
Synthesized from the book passages below. Chat with the book on Feynman for follow-up.
From the book
Title: Time, Clocks and the Ordering of Events in a Distributed System by Leslie Lamport Pages: 50
More questions about this book
- Imagine explaining the core problem Lamport addresses to someone completely new to computer science, using a real-world analogy. How would you describe the fundamental challenge of "ordering events" in a "distributed system," and why simply using synchronized physical clocks isn't enough?
- Lamport introduces the "happens-before" relation, which defines a *partial ordering* of events. Why is a partial order sufficient, and often more desirable or practical, than attempting to establish a total, globally consistent ordering of all events in a distributed system?
- If a distributed system were to completely disregard Lamport's insights on logical clocks and event ordering, what concrete *anomalies* or *incorrect behaviors* could occur in a seemingly simple operation, like two users simultaneously updating the same shared document or resource?
- How does Lamport's formalization of logical time fundamentally alter our understanding of "causality" in a distributed environment, moving beyond a purely physical notion of time? What are the implications of this shift for designing reliable distributed algorithms?