Q2Distributed System

Leslie Lamport mathematically proved that synchronizing physical clocks across a massive distributed network is impossible and largely unnecessary. Instead of relying on real-world seconds, he engineered a strict logical architecture based entirely on the Causality of events, known as the "happens-before" relation (denoted as $\to$).

The Mathematical Rules of Execution

Every single Node $P_i$ in the cluster maintains a simple integer software counter $C_i$, initialized to $0$. The clocks obey two absolute, rigid mathematical rules:

• Rule 1 (Internal Events): Before Node $P_i$ executes ANY event (computation, reading a file), it violently increments its own clock: $$C_i=C_i+1$$
• Rule 2 (Message Passing): When Node $P_i$ blasts a message $M$ to Node $P_j$, it mathematically piggybacks its current clock value $C_i$ onto the network packet: $M(C_i)$. When Node $P_j$ receives the message, it MUST aggressively synchronize its own clock to be mathematically higher than both its own current time AND the sender's time. It executes: $$C_j=\max (C_j,C_i)+1$$

Architectural Example

Assume Node A ($C_A=2$) and Node B ($C_B=10$). Node A sends a critical database update to Node B.

• Node A increments its clock: $C_A=3$. It transmits $M(3)$.
• Node B is already at $10$. When it receives $M(3)$, it executes $C_B=\max (10,3)+1=11$.
• Now assume Node B ($C_B=10$) sends a message to Node A ($C_A=2$).
• Node B increments: $C_B=11$. It transmits $M(11)$.
• Node A receives $M(11)$. Node A mathematically realizes it is wildly behind in the timeline. It aggressively forces its clock forward: $C_A=\max (2,11)+1=12$.

This mathematical architecture guarantees that if Event X caused Event Y, the timestamp of X will absolutely always be numerically smaller than the timestamp of Y, perfectly preserving causal history across the chaotic network.