Tag
concurrency
- Oct 2, 2026 Inter-Operator Parallelism and Stream Scheduling Independent branches of a graph can run concurrently on separate queues, but overlap only helps when the branches use different resources and the dependencies are exact. inference systems
- Sep 10, 2026 Searcher Snapshots and Lock-Free Concurrent Readers How a search engine publishes a new index version to running queries without pausing them, using copy-on-write searcher snapshots and reference counting. information retrieval
- Sep 2, 2026 Streams, Events, and Concurrent Kernel Execution What a stream actually orders, why two kernels can overlap or fail to, and how events turn a stream of launches into a dependency graph. gpu computing
- Jul 27, 2026 Concurrency Per Environment and the Unit a Function Platform Scales Why serverless platforms scale environments rather than requests, how per-environment concurrency changes the arithmetic, and where the queue lives when the limit is reached. cloud infrastructure
- Jul 10, 2026 Concurrent Mutations and Versioned Session Records Why whole-record writes lose updates when a browser issues requests in parallel, and how compare-and-set, fencing tokens, and delta operations keep the record coherent. backend systems
- Jun 21, 2026 Concurrent Readers on a Mutating Trie Lookups traverse many dependent loads, so per-node locking is untenable. How publish-then-swap, deferred reclamation, and path copying keep readers safe while nodes grow and split. data structures
- Jun 3, 2026 Coordinating Tabs with Locks, BroadcastChannel, and Storage Events How Web Locks give same-origin tabs a queue per name, what BroadcastChannel does and does not deliver, and why the storage event cannot serve as a mutex. web platform
- Jan 3, 2026 Concurrent Descent and Page Latching in a Shared B-Tree How readers descend without blocking writers, why a split needs the parent as well as the child, and how the Lehman-Yao protocol avoids deadlock. databases
- Jul 11, 2025 Bit-Banding: Atomic Single-Bit Access Through an Alias Address Region How the Cortex-M3 and M4 alias one bit of memory to a whole word, what address arithmetic maps bit to word, and why the feature disappeared from later cores. embedded systems
- Jun 20, 2025 Little's Law as a Consistency Check on Load Measurements How the identity connecting concurrency, arrival rate, and residence time exposes inconsistent measurement sets, plus the sampling errors and boundary conventions that make a correct system appear to violate it. performance engineering
- Jun 14, 2025 Attack Nets, Concurrency, and the State-Space Explosion How Petri-net attack models represent parallel attacker actions and partial progress, why the reachability graph grows faster than exponentially, and which reductions keep analysis tractable. security
- Jun 2, 2025 Latch Coupling and Deadlock Avoidance in the Buffer Pool Why latches are not locks, how lock coupling keeps a B-tree descent deadlock-free, what a partitioned buffer pool hash table buys, and where contention concentrates. databases
- Dec 25, 2024 Throughput, Latency, and Why Concurrency Is Not Parallelism How the relation between completion rate, response time, and in-flight work constrains every scaling decision, and why overlapping waits and splitting computation buy throughput in different ways. performance engineering
- Jun 4, 2024 Little's Law: Concurrency, Arrival Rate, and Time in System Why the identity L = λW holds without any assumption about the arrival distribution, how the choice of system boundary changes all three terms at once, and where the accounting breaks when requests are dropped or retried. performance engineering
- May 8, 2024 Per-Host Request Rate Limits and the Cost of a Fixed Delay Why a constant delay between requests is the simplest defensible politeness policy, how concurrency multiplies the rate a server actually sees, and where the model fails. information retrieval
- Feb 20, 2024 The KV Cache Memory Budget and What It Costs per Token Deriving bytes per cached token from attention shapes, then turning the freed capacity into a hard ceiling on concurrency and a floor on cost per token. inference systems
- Sep 28, 2023 Little's Law and the Size of a Request Pool Why the number of requests in flight equals arrival rate times service time, how that identity fixes a pool size, and why adding workers past that point buys no throughput. backend systems
- Apr 11, 2023 How Metadata Locks Block a DDL Statement Behind Ordinary Queries The lock queue that a schema change must pass through, why a short query in front of it can stall every new reader of the table, and the timeout that bounds the damage. databases