Tag
sharding
- Oct 20, 2026 Sharded Counters, Padding, and False Sharing Why two independent counters placed next to each other can cost more than one shared counter, how cache-line granularity forces padding, and what sharding gives up in exchange. performance engineering
- Oct 13, 2026 Why Append-Only Keys Concentrate Load on One Shard Monotonic keys place every insert at the end of the key space, so one partition absorbs the write traffic. The fixes, from bit-reversal to bucket suffixes, and what each costs. distributed systems
- Sep 21, 2026 Sharding Session Data and the Size Ceiling How session keys are partitioned across nodes as the store grows, why resharding is safer at a partition layer, and what a large cookie costs on every request. backend systems
- 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 7, 2026 Shard Routing and Ownership Metadata: The Directory That Must Not Disagree How clients find the shard for a key, what happens when the routing table is stale, and why ownership epochs turn a racy handoff into a detectable error. databases
- 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
- May 26, 2026 Two-Phase Commit Across Shards: The Coordinator, the Veto, and the In-Doubt Window How prepare and commit phases make a cross-shard transaction atomic, why a coordinator failure leaves participants unable to decide, and what presumed abort changes. 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
- Feb 17, 2026 Partitioning a Workload So Every Thread Reads Local Memory How to divide data and threads so that each partition lives on the node that processes it, what the boundaries between partitions cost, and where the design breaks on machines with uneven node counts. memory systems
- Dec 30, 2025 Fleet-Wide Alerting and the Per-Instance Rule Why the aggregation level of an alerting rule decides both what it can detect and how many notifications it produces, and how to choose between per-instance, per-shard, and fleet-wide evaluation. observability
- Oct 15, 2025 Local and Global Secondary Indexes Under Partitioning An index can be partitioned with the data or by the indexed value. The first makes writes cheap and reads expensive; the second inverts it, and neither is free. distributed 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
- Sep 6, 2024 ZeRO Stages: Sharding Optimizer State, Gradients, and Parameters How the three partitioning stages divide training state across data-parallel ranks, what communication each one adds, and why stage 3 changes the residency model rather than just the arithmetic. deep learning
- Apr 12, 2024 Shard Routing and Replica Consistency in Distributed Search How a search index is split across many machines, how a query fans out to shards and merges their results, and how replicas stay consistent with their primary shards. information retrieval
- Apr 29, 2023 Routing Metadata Staleness and the Cost of a Wrong Guess Every client caches a map from key to node, and every cache is wrong eventually. How epochs, redirects, and fencing turn a stale guess into a retry instead of a lost write. distributed systems
- Mar 2, 2023 Range Partition Boundaries and the Split Key Contract How ordered partitions are divided, why a split key is a durable fact rather than a hint, and what happens when boundaries are chosen badly. distributed systems
- 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