distributed systems
13 articles tagged distributed systems.
-
Tail-Based Distributed-Trace Sampling
How collectors buffer spans, make trace-wide sampling decisions, and keep complete useful traces without exhausting memory or ingestion capacity.
-
Amazon SQS Visibility Timeouts and Receipt Handles
How SQS hides received messages, uses receipt handles for deletion, and produces duplicate processing when workers outlive visibility timeouts.
-
Consistent Hashing and Virtual Nodes
See how a hash ring assigns keys to members, and why membership changes remap only a small, predictable portion of the data.
-
Raft Leader Election and Majority Voting
How Raft uses terms, randomized timeouts, and majority votes to elect one leader and keep conflicting log entries from being committed.
-
Hybrid Logical Clocks
How hybrid logical clocks combine wall-clock readings and counters to preserve causality across distributed systems despite clock skew.
-
Quorum Reads and Writes in Replicated Datastores
How N, R, and W thresholds trade consistency for availability when replicated datastore nodes fail or lag.
-
Consistent Hashing Rings and Virtual Nodes
Learn how hash rings and virtual nodes assign cache keys so adding or removing a host remaps only a fraction of the keyspace.
-
How W3C Trace Context Propagates Distributed Traces
Learn how traceparent carries trace identity, parent-child span relationships, and sampling decisions across service boundaries.
-
How Raft Leader Elections Work
Raft uses numbered terms, randomized timeouts, majority votes, and log checks to elect one safe leader and recover from split votes.
-
Amazon SQS Visibility Timeout and Message Processing
Understand how SQS hides received messages, why crashes cause redelivery, and how workers safely extend processing time.
-
How Tail-Based Trace Sampling Works
Tail-based sampling waits for a trace’s outcome, then keeps or discards every span using evidence from the complete trace.
-
Amazon S3 Multipart Uploads
How S3 uploads large objects as verified parts, assembles them atomically, and why incomplete uploads must be aborted or expired.
-
Consistent Hashing on a Ring
How consistent hashing assigns keys around a ring, uses virtual nodes to balance load, and limits key movement during membership changes.