Tag
clock-skew
- Oct 23, 2026 Setup and Hold Slack: Reading a Static Timing Report How arrival and required times are propagated through a timing graph, why setup and hold checks run in opposite directions, and how skew, derating, and path exceptions change the verdict. hardware engineering
- Aug 15, 2026 Wall-Clock Timestamps Do Not Order Distributed Events Why two machines reading the same instant produce different numbers, how far the disagreement grows between synchronizations, and what an interval-bounded timestamp can still support. distributed systems
- Jan 26, 2026 The NTP Four-Timestamp Exchange and Its Asymmetry Limit How four timestamps yield an offset estimate, why the estimate is only as good as the path symmetry, and how the protocol decides which of several servers to believe. distributed systems
- Jan 22, 2026 Bounded Clock Uncertainty and the Commit-Wait Rule How a clock that returns an interval instead of an instant lets a system order transactions by physical time, why reads must wait out the uncertainty, and what the wait costs. distributed systems
- Oct 17, 2025 Retiming and Balancing the Stages of a Datapath How logic is moved across pipeline registers to shorten the longest stage, which moves are legal, and why a balanced pipeline is a fixed-point problem rather than a partition. computer architecture
- Jul 23, 2025 Clock Skew and the Arithmetic of Span Durations Why span durations stay trustworthy while span start times do not, how skew makes a child appear to outlive its parent, and what correction can and cannot recover. observability
- May 5, 2025 Clock Networks, Global Buffers, and Skew Budgets Why a clock reaches every register through a dedicated balanced tree, what skew and jitter cost a timing budget, and when a clock must be routed on general interconnect instead. hardware engineering
- Mar 7, 2025 Clock Skew, Jitter, and the Synchronous Timing Budget The two inequalities that decide whether a synchronous design works, how skew helps setup and hurts hold, and why clock distribution is a first-class design problem. hardware engineering
- Aug 30, 2024 Hybrid Logical Clocks: Physical Time With a Logical Counter How HLC timestamps stay close to wall-clock time while preserving causality, why the counter only appears inside the uncertainty window, and what a bounded timestamp costs. distributed systems
- Jun 26, 2024 TOTP Time Steps, Drift Windows, and Code Replay How a shared secret and a counter quantised to thirty seconds produce a six-digit code, why the verifier searches a window, and what makes a used code reusable. security
- Aug 22, 2023 Deep Pipelines and Why More Stages Stop Paying The arithmetic of latch overhead, the growing penalty for branches and exceptions, and the point at which another stage costs more throughput than it returns. computer architecture
- Jul 21, 2022 Clock Skew Injection and the Failures That Depend on Wall Time The difference between clock offset, skew, and drift, the two ways to inject a time fault without breaking the host, and which classes of software fail when wall time jumps. devops