Tag
consistent-hashing
- Aug 26, 2026 Consistent Hashing and What Resharding Costs a Cache Tier Why modular hashing turns a single added node into a near-total cache flush, how ring and rendezvous schemes bound the keys that move, and what slot-based clusters still charge for rebalancing. backend systems
- Aug 6, 2026 CRUSH Placement: Deterministic Mapping Over a Weighted Hierarchy How a pseudorandom placement function turns an object identifier and a cluster map into a device list, why straw selection replaced simpler bucket types, and what changes on topology edits. filesystems
- Jul 25, 2026 Load Balancing Policy and Effective Capacity How assignment policy, connection reuse, and request-class knowledge change the throughput a pool can sustain, and why a policy tuned for latency can reduce total capacity. performance engineering
- Jul 20, 2026 Consistent Hashing and What Changes When a Node Joins Why modulo placement reshuffles almost every key on a membership change, how a hash ring limits the movement, and where the ring still concentrates load. filesystems
- Jun 17, 2026 Hash and Range Partitioning: Choosing What the Shard Key Preserves Why range partitioning keeps ordered scans and concentrates writes, why hashing spreads load and destroys locality, and how consistent hashing changes only the movement cost. databases
- Mar 23, 2026 Consistent Hashing Rings and Virtual Node Counts Why a ring moves only 1/(n+1) of the keys when a node joins, how virtual nodes fix the variance, and what the load spread looks like at realistic counts. distributed systems
- Jul 23, 2025 Weighted Canary Routing at the Edge and What the Weight Measures Whether a traffic weight applies to connections, requests, or users, how hashing turns percentages into fixed partitions, and why small canaries cannot resolve small error differences. devops
- Nov 19, 2024 Load Balancer Session Affinity and Its Failure Modes How sticky routing is implemented at layer 4 and layer 7, why consistent hashing limits the damage of a node loss, and which failures affinity cannot prevent. backend systems
- Feb 17, 2024 Routing Traces Through a Collector Pipeline by Trace ID Why a stateful tracing stage cannot sit behind a round-robin load balancer, how consistent hashing keeps one trace on one worker, and what happens when the worker set changes. observability
- Aug 8, 2023 Partitioning a Crawl Across Machines Without Duplicate Fetches Why host-based partitioning is the only split that preserves politeness, how a frontier survives reassignment, and what happens when one partition dies. information retrieval