Complete archive
Archive
3,240 articles, newest first · page 26 of 54. For subject-based browsing use topics; for keyword lookup try search. Dates shown are assigned archive dates that order the library; they are not historical publication records.
-
2025
Aug 8, 2025 Divergence and the Reconvergence Stack How a warp executes both sides of a branch when its lanes disagree, what the per-warp mask stack records, and why reconvergence is not always where the source suggests. gpu computing · foundational - Aug 8, 2025 Merge Sort: Why Stability Survives the Merge and What the Buffer Costs The merge invariant that preserves equal-key order, the three places extra memory is required, and how natural runs turn the algorithm adaptive. algorithms · foundational
- Aug 6, 2025 Blocking and Non-Blocking Assignment: What Each Maps To in Silicon How the two assignment forms differ in when they update their target, why one models a wire and the other a flip-flop, and where mixing them produces a simulation that does not match the netlist. hardware engineering · foundational
- Aug 6, 2025 Blocking Primitives: How a Task Waits Without Spinning The blocked-state bookkeeping behind a semaphore take, how a woken task reaches the ready set, and what the wake-up path costs in latency and stack. embedded systems · foundational
- Aug 6, 2025 Partition Evolution Without Rewriting Existing Data How a table can change its partition granularity while old files keep their original layout, why the manifest must record the spec that produced each file, and what queries pay for the mixture. data engineering · intermediate
- Aug 6, 2025 Power Delivery Network Impedance and the Target It Must Hold How a target impedance is derived from a rail voltage and current step, why the capacitor network has anti-resonances, and where mounting inductance defeats the parts on the schematic. hardware engineering · intermediate
- Aug 6, 2025 Protection Information: Eight Bytes That Catch Misdirected Writes How T10 protection information appends a CRC, a reference tag, and an application tag to every logical block, and what it costs to check them at the drive and at the host. hardware engineering · advanced
- Aug 6, 2025 Vertex Attribute Quantization and the Range It Depends On How positions and normals become 16-bit integers with a per-mesh scale and bias, where the error lands, and why renormalization after fetch is mandatory. computer graphics · intermediate
- Aug 5, 2025 Radio Resource Control States and the Tail Timer After the Last Byte Why a cellular radio stays powered for seconds after a transfer ends, what each connection state costs, and how the spacing of requests decides which transitions are paid. mobile computing · foundational
- Aug 5, 2025 Swizzled Texel Layouts and the Cost of a Bilinear Fetch Why row-major storage makes a four-texel fetch hit two cache lines or more, how tiled and Morton-ordered layouts repair it, and where the repair stops paying. computer graphics · advanced
- Aug 4, 2025 Earliest-Finish-First for Interval Scheduling Why sorting intervals by finishing time and accepting each compatible one yields a maximum set, and why sorting by start time or by length does not. algorithms · foundational
- Aug 4, 2025 Entropy Rate of a Markov Source and the Value of Context Why the per-symbol cost of a source with memory is not its order-0 entropy, how the entropy rate is computed from a transition matrix, and what context models capture that frequency tables cannot. computation theory · intermediate
- Aug 4, 2025 Reserved Values and the Practice of Keeping Extension Points Alive How unallocated code points, GREASE values, and deliberate noise keep implementations honest about skipping unknown fields, and what that costs on the wire. internet protocols · intermediate
- Aug 2, 2025 Confounded Comparisons Between Canary and Baseline A canary differs from its baseline in more than the code it shipped. Traffic mix, cache warmth, host hardware, and routing all shift at once, and a rare-event hypothesis needs far more requests than intuition suggests. observability · intermediate
- Aug 2, 2025 Spectral Clustering and the Relaxation of Normalized Cut Turning points into a weighted graph, writing the partition cost as a cut, and relaxing the discrete indicator vector into an eigenvector problem explains why the method recovers non-convex groups and why the affinity scale decides the answer. machine learning · intermediate
- Aug 1, 2025 Closure Capture, Lexical Scope, and Storage Duration Why capturing a variable is a decision about storage rather than about names, how an escaping frame is moved to the heap, and what breaks when a loop body shares one binding. compilers · intermediate
- Aug 1, 2025 Spectral Leakage, Scalloping, and Segment Averaging Why a finite record smears tones across DFT bins, how scalloping loss depends on the window, and what averaging overlapping segments does to variance and bias. scientific computing · intermediate
- Aug 1, 2025 Subset DP with Bitmask States: Held-Karp and the 2-to-the-n Wall Encoding a visited set as an integer makes the traveling-salesman recurrence exact in O(2^n n^2), and the same encoding supports submask enumeration and the sum-over-subsets transform. algorithms · advanced
- Aug 1, 2025 The Main Thread Message Queue and Why a Single Long Task Delays Frames How a looper serializes work onto one thread, how synchronization barriers let frame callbacks overtake queued messages, and what makes a task on the queue expensive beyond its own duration. mobile computing · foundational
- Aug 1, 2025 Undefined Behaviour as a Compiler Permission Why the optimiser treats undefined behaviour as a promise about what never happens, and how that promise lets it delete checks, fold comparisons, and reorder loads. systems programming · foundational
-
July
Jul 31, 2025 Measuring and Bounding Interrupt Latency What latency means at each point between a device asserting and a thread running, which mechanisms inflate the tail, and why the distribution rather than the average is the design target. operating systems · advanced - Jul 31, 2025 Reverse Mapping: Finding Every Page Table That Points at a Frame Why the kernel needs to go from a physical frame back to its mappings, how the reverse index is built and maintained, and what it costs in memory and lock contention. memory systems · intermediate
- Jul 31, 2025 Storage Quota, Persistence, and Eviction Why a cache that was written successfully can be gone on the next visit, how best-effort and persistent buckets differ, and what estimate() does and does not tell an application about its budget. web platform · advanced
- Jul 30, 2025 Bounded Queues, Backpressure, and What to Drop Under Overload Why an unbounded queue converts a capacity problem into a latency problem, how a queue bound is derived from a target latency, and the shedding policies that decide which requests are refused. performance engineering · advanced
- Jul 30, 2025 Decomposing Write Amplification in Log-Structured Filesystems The four terms that add up to bytes written per byte of user data, namely cleaning copies, checkpoint rewrites, summary overhead, and segment slack, and how each responds to segment size. filesystems · intermediate
- Jul 30, 2025 License Compatibility and the Direction of Relicensing Combining two licensed works produces one distribution that must satisfy every condition in it; why permissive code can move into copyleft but not the reverse, and which patent and version clauses block a combination outright. computing history · foundational
- Jul 30, 2025 Object Capabilities and the Confused Deputy How unforgeable references replace identity checks, why ambient authority enables the confused deputy, and what membrane and revocation designs cost in a capability system. security · intermediate
- Jul 30, 2025 Prototype Chains and Delegation-Based Dispatch How property lookup walks a prototype chain, why methods are stored once per prototype instead of once per object, and where the chain design costs lookup time. programming languages · foundational
- Jul 30, 2025 Quota Accounting and Eviction Under Storage Pressure How browsers measure an origin's storage usage, where the quota figure comes from, what persistence changes, and how a victim is chosen when the disk fills. web platform · intermediate
- Jul 30, 2025 What Occupancy Actually Counts Why occupancy is a ratio of resident warps to a hardware maximum rather than a utilization measure, and how registers, shared memory, and block limits each cap it. gpu computing · foundational
- Jul 29, 2025 Hash Functions for Table Indexing: Mixing, Avalanche, and Universal Families What a table hash must satisfy beyond producing an integer, why identity hashing fails on power-of-two tables, and how multiply-shift and finalizers repair weak input bits. data structures · intermediate
- Jul 29, 2025 Lockfiles and How a Version Range Becomes a Tree Why a range in a manifest is not a pin, what a lockfile records that the manifest cannot, and how resolvers settle or fail on conflicting requirements. devops · foundational
- Jul 29, 2025 Partitioned Boolean Quadratic Programming for Register Allocation How encoding allocation as per-node costs plus per-edge cost matrices lets a solver trade spills against copies with a single objective, and why reduction rules beat coloring heuristics on hard graphs. compilers · advanced
- Jul 28, 2025 Deadline Propagation Across Service Hops Why a timeout configured independently at each hop produces work nobody waits for, how an absolute remaining budget survives the chain, and where cancellation actually stops. software architecture · advanced
- Jul 28, 2025 Distance Concentration and Hubness in Embedding Spaces Why nearest-neighbour search degrades in high dimensions, how a few points become hubs that absorb most queries, and what those effects imply for measuring similarity between learned vectors. deep learning · foundational
- Jul 28, 2025 Inductive Invariants Over Reachable States Why an invariant that holds initially and is preserved by every step still needs an induction hypothesis, and how the strengthening problem makes proofs fail. software engineering · foundational
- Jul 28, 2025 Page Migration: What a Move Between Nodes Costs How the kernel relocates a populated page from one node to another, why the operation needs to unmap every mapping first, and the conditions under which a requested migration silently does nothing. memory systems · intermediate
- Jul 28, 2025 Read Models Across Service Boundaries What changes when a screen needs data from three owners, how a replicated projection trades freshness for availability, and how to make staleness a stated contract instead of a bug report. software architecture · advanced
- Jul 28, 2025 Sampled Allocation Profiling and the Cost of Interposing on malloc How heap profilers attribute live memory to allocation sites, why sampling by size needs corrections the CPU analogue does not, and what interposition itself costs. observability · advanced
- Jul 26, 2025 The Probabilistic Method in Derandomized Form: Conditional Expectations and Small-Bias Spaces How to remove randomness from an algorithm without losing its guarantee, using conditional expectations, pairwise-independent sample spaces, and epsilon-biased distributions. algorithms · advanced
- Jul 25, 2025 Envelope Encryption and the Two-Level Key Hierarchy Why bulk data is encrypted under a per-object data key wrapped by a long-lived master key, and what the indirection buys and costs. cryptography · foundational
- Jul 25, 2025 How Many Topics a Benchmark Needs Why the standard error of a mean metric is dominated by topic-to-topic variance, and how resampling shows when a query set is too small to separate two systems. information retrieval · intermediate
- Jul 25, 2025 Sampling BRDF Lobes and Choosing Between Them How a probability density over outgoing directions turns a reflectance integral into a weighted average, why GGX sampling has a closed form, and how lobe selection probabilities affect variance. computer graphics · intermediate
- Jul 24, 2025 Learned Indexes: Fitting a Function Instead of Storing Keys How a model that predicts a key position can replace a B-tree search, what the error bound guarantees, and why the last mile is always a search. algorithms · advanced
- Jul 24, 2025 Log Compaction, Retention, and Replay Retention deletes from the start of a log and compaction keeps only the newest value per key, which turns the log into a replayable store of current state. backend systems · advanced
- Jul 24, 2025 Memory Reclamation for Lock-Free Structures Hazard pointers, epoch-based reclamation, and reference counting compared by what they cost on the read path, when memory is actually returned, and which failure they tolerate. systems programming · advanced
- Jul 24, 2025 Merkle Trees, Range Digests, and Finding Divergence Without Reading Everything How a tree of hashes narrows a comparison between two replicas to the differing leaves, what it costs to maintain under writes, and why the leaves must align. filesystems · intermediate
- Jul 24, 2025 SR-IOV and How One Device Becomes Many Functions How a physical function creates lightweight virtual functions with their own configuration space and requester IDs, and why function-level isolation is not resource isolation. hardware engineering · advanced
- Jul 24, 2025 The Exchange Argument: Proving a Greedy Choice Is Safe How replacing the first divergence between an optimal solution and a greedy one establishes correctness, and why the same swap fails on problems like 0/1 knapsack. algorithms · foundational
- Jul 24, 2025 The Fragile Base Class Problem in Compiled Hierarchies Why adding a virtual function or a data member to a published base class breaks already-compiled clients, which changes are binary compatible, and how interfaces avoid it. programming languages · intermediate
- Jul 24, 2025 Why Piecewise-Constant Tree Ensembles Cannot Extrapolate Beyond the largest value seen in training, every threshold test returns the same answer, so the prediction freezes. The consequence and the partial remedies follow from the shape of the fitted function. machine learning · advanced
- Jul 23, 2025 Clock Skew and the Arithmetic of Span Durations Why span durations stay trustworthy while span start times do not, how skew makes a child appear to outlive its parent, and what correction can and cannot recover. observability · intermediate
- 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 · foundational
- Jul 22, 2025 How a Configuration Value Resolves: Precedence, Merge Modes, and Missing Keys The lookup rules that turn many layers of data into one value, why first-found and deep-merge hierarchies disagree, and why undefined and empty are different states. devops · intermediate
- Jul 22, 2025 The Overlay and Underlay Split in Virtual Networks How a virtual network carries its own addresses inside an ordinary routed network, what the mapping between the two layers costs, and where the separation leaks. networking · foundational
- Jul 22, 2025 Torn Writes, Journal Checksums, and Detecting a Bad Commit Why a commit record that exists is not proof that its transaction is intact, how checksumming the log closes that hole, and what remains undetectable. filesystems · intermediate
- Jul 21, 2025 Feature Hashing and the Collision Bound That Sets Its Width Why signed hashing leaves inner products unbiased, how many collisions a fixed width produces, and the error term that appears in place of a vocabulary lookup. machine learning · advanced
- Jul 21, 2025 The Synchronous Storage Contract of localStorage and sessionStorage Why the Web Storage APIs expose a blocking string map, what that costs on the main thread, how storage events propagate, and where the quota boundary shows up. web platform · foundational
- Jul 20, 2025 Completion Filtering, Ranking, and Lazy Item Resolution Why the editor filters the completion list itself, how the three strings on an item control matching and ordering, and what the resolve round trip buys when documentation is expensive to build. developer tools · intermediate
- Jul 20, 2025 In-Circuit Programming: Why the Flash Algorithm Runs From RAM How a probe erases and writes flash through the target core, why the routine cannot execute from the memory it is modifying, and what sector granularity costs an update. embedded systems · advanced