Tag
rebalancing
- 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
- 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
- May 27, 2026 Splitting a Partition While Writes Continue The in-place split protocol: freeze, cut, publish, then let readers discover the new boundary. Why the split point is a durable record and why the parent must keep serving. distributed systems
- 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
- Aug 22, 2025 Rebalance Storms and the Backpressure That Prevents Them When a node fails, every partition it held becomes a migration at once. Why the recovery traffic can exceed the cluster bandwidth, and how admission control keeps the two from feeding each other. distributed systems
- Aug 17, 2025 Consumer Groups and Partition Assignment How a group coordinator keeps one owner per partition, what a generation change does to in-flight work, and why the assignor choice changes rebalance cost. backend systems
- Jul 1, 2025 Online Resharding: Moving a Range Without Stopping Writes How a range is migrated while it is being written to, why the cutover is a metadata transaction, and what the dual-write window costs in correctness. databases
- Dec 20, 2024 Shard Migration Cutover and the Dual-Write Window How a partition moves between machines without losing writes, why the cutover is a state machine rather than a copy, and what has to be true before the source is retired. distributed systems
- Nov 29, 2024 Rotations and the In-Order Sequence They Preserve How a single rotation rewires three pointers while keeping key order, why some violations need two rotations, and what a rotation cannot repair. data structures
- Apr 20, 2022 Hash Partitioning and the Range Query It Destroys How modulo hashing places keys on nodes without any directory, why the same function makes ordered access impossible, and what a resize really moves. distributed systems