Complete archive
Archive
3,240 articles, newest first · page 24 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
Sep 19, 2025 Time Namespaces and the State That No Namespace Covers How a time namespace shifts the monotonic and boottime clocks without changing the wall clock, and which kernel resources remain global no matter how many namespaces a process joins. operating systems · advanced - Sep 18, 2025 Array of Structs or Struct of Arrays How element stride decides which fields a scan pulls into cache, when splitting a record into parallel columns pays, and what the split costs elsewhere. data structures · intermediate
- Sep 18, 2025 Merging Profiles Across a Fleet Without Losing the Tail Why summing per-host profiles answers a different question than profiling the fleet, how weight normalization changes the answer, and what a merged profile cannot tell you. observability · intermediate
- Sep 18, 2025 Query-Document Feature Extraction for Learned Ranking How match statistics, proximity windows, and coverage ratios are computed from position lists, and what each feature measures that a bag-of-words score cannot. information retrieval · intermediate
- Sep 18, 2025 Why Locks Across Independent Services Do Not Compose Two lock services with no shared order can each grant a lock that the other believes excludes, and no client-side protocol repairs the missing global order. distributed systems · advanced
- Sep 17, 2025 Cold Start Anatomy: What Happens Between a Request and the First Instruction The stages a function invocation passes through before user code runs, which stages dominate the delay, and why warm pools change the shape of the curve. cloud infrastructure · foundational
- Sep 17, 2025 Spooling: Turning Unit-Record Devices into Disk Files How simultaneous peripheral operations on line decouple card reading from job execution, what a spool data set must contain, and why the queue becomes the scheduler. computing history · intermediate
- Sep 16, 2025 Reverse-Mode Differentiation on the Computational Graph How a recorded graph of elementary operations turns the chain rule into one reverse sweep, why values with several consumers force an accumulation, and where that sweep silently produces wrong gradients. deep learning · foundational
- Sep 15, 2025 Differential Testing Between a Legacy System and Its Replacement How to run old and new implementations on the same inputs, normalise what is legitimately different, and classify divergences without an external specification to appeal to. software architecture · advanced
- Sep 15, 2025 Memory Pressure, Kill Decisions, and What an App Can Observe Before It Dies How the platform ranks processes for termination under memory pressure, why a backgrounded app is not safe, and which signals give an app warning before the kill. mobile computing · intermediate
- Sep 15, 2025 Shared-Bus Arbitration and the Clock Ceiling That Ended It How a multiplexed parallel bus runs one transaction at a time, how a central arbiter decides which master owns the wires, and which electrical limits forced the move to point-to-point links. hardware engineering · foundational
- Sep 15, 2025 What a Fence Instruction Actually Does to the Pipeline The three mechanisms behind fence cost — buffer drain, request acknowledgement, and memory-operation serialisation — and why a fence is never a cache flush. computer architecture · intermediate
- Sep 14, 2025 Polyphase Decimation and the Cost of Changing Sample Rate Why a naive resampler computes samples it discards, how the polyphase decomposition removes that work, and what the filter length must satisfy before downsampling. scientific computing · advanced
- Sep 14, 2025 What Live Memory Acquisition Changes While It Reads Why the act of capturing physical memory alters the state being captured, which artifacts survive the read, and the ordering rules that follow from the perturbation. security · intermediate
- Sep 13, 2025 Instability, Abstractness, and Distance from the Main Sequence How afferent and efferent coupling produce two ratios per package, why their sum locates a package in a zone of pain or uselessness, and where the arithmetic stops being informative. software architecture · foundational
- Sep 13, 2025 Licensing a Patent Inside a Standard: RAND, Royalty-Free and the Gap Between Them What a standards body patent policy actually promises implementers, why RAND terms are vague by design, and how royalty-free commitments get conditioned. computing history · intermediate
- Sep 12, 2025 Correlated Timeouts and Detection Storms When Every Monitor Sees the Same Fault Why independent observers are only independent when their failures are uncorrelated, how a shared cause turns many weak suspicions into a confident wrong verdict, and which randomization actually helps. distributed systems · intermediate
- Sep 12, 2025 Key Design and Eviction in External Session Stores How session records are keyed, sized, and expired in Redis and Memcached, and why an eviction policy can turn a memory shortage into a login outage. backend systems · intermediate
- Sep 12, 2025 Retry Ladders and Dead-Letter Promotion for Failed Jobs How job retries differ from request retries: escalating delays held as queue state, caps in wall-clock time, crash loops, and what promotion to a dead-letter state must preserve. backend systems · intermediate
- Sep 11, 2025 Build, Host, and Target: Three Machines in One Toolchain Why a cross build needs three machine names rather than two, which of them selects the compiler, and how a compiler that runs somewhere other than where it was built gets produced. systems programming · foundational
- Sep 11, 2025 Hidden Classes and the Transition Tree Behind Property Writes How a runtime derives a shared layout descriptor from the sequence of property additions, why the order of those additions decides which descriptor an object ends up with, and what a transition edge has to store. language runtimes · foundational
- Sep 11, 2025 The DRF-SC Guarantee and What It Buys a Programmer Why race-free programs are sequentially consistent on hardware that is not, and the composition rules that let this promise survive layers of abstraction. memory systems · intermediate
- Sep 10, 2025 Technology Mapping: Covering a Boolean Network With Library Cells How synthesis chooses cells from a standard-cell library to implement an optimized gate network, why the choice is iterative once real loads and slews enter the cost, and what fanout limits force into the netlist. hardware engineering · intermediate
- Sep 9, 2025 Cache Storage Keys, Vary, and Cache Versioning How the Cache API compares a request against stored entries, why HTTP freshness headers are inert inside it, and how cache names and activate-time deletion keep a deployment consistent. web platform · foundational
- Sep 9, 2025 Cross-Origin Isolation with COOP and COEP How Cross-Origin-Opener-Policy and Cross-Origin-Embedder-Policy combine to produce crossOriginIsolated documents, and what CORP must do on the other side of each load. web platform · intermediate
- Sep 9, 2025 Semantic Versioning as a Compatibility Contract What each of the three version numbers is allowed to promise, how the ordering rules work, and why the compatible-change rule only holds for the parts of a surface a project actually constrains. devops · foundational
- Sep 8, 2025 Adaptive Partitioning and Runtime Repartitioning How a shuffle writer reports per-partition sizes at the stage barrier, and how coalescing and splitting use that report to correct a partition count chosen before the data was read. data engineering · advanced
- Sep 8, 2025 Decoding a Kernel Fault Report What the register dump, the faulting address, and the call trace each establish, how to tell a null dereference from a use-after-free, and why a tainted kernel changes the reading. operating systems · intermediate
- Sep 8, 2025 How Null Rates and Distinct Counts Detect a Broken Join Column profiles are cheap aggregates that catch errors no type check can: a null-rate jump or a collapsed distinct count localises a fault to one column. data engineering · intermediate
- Sep 8, 2025 Key Destruction, Retired Keys, and Cryptographic Erasure Why deleting a key is not the same as destroying it, what media retain after overwrite, and how destroying a wrapping key deletes data it never touched. cryptography · advanced
- Sep 8, 2025 When a Snapshot Is Taken and How Commit Order Is Assigned The choice between transaction-start and first-statement snapshots, the in-progress list that defines the read view, and why a single commit counter is a shared resource. databases · intermediate
- Sep 7, 2025 The Shift Register Behind SPI and Why There Are Four Clock Modes Two shift registers joined by two wires explain SPI completely, including the CPOL and CPHA combinations, the daisy chain, and the consequences of having no acknowledgement. embedded systems · foundational
- Sep 6, 2025 Definite Assignment as a Flow-Sensitive Dataflow Problem How a checker proves every variable is written before it is read, why the answer depends on control flow rather than scope, and how the lattice and transfer functions are chosen. compilers · intermediate
- Sep 6, 2025 Two Address Spaces: Port-Mapped and Memory-Mapped I/O Decoding Why the 8080 family reserved a separate 256-byte I/O space, how the control signals distinguish it from memory, and what each arrangement costs in address decoding and instruction width. computing history · foundational
- Sep 5, 2025 Chain Replication: Why the Head Writes and the Tail Reads How ordering replicas into a chain turns replication into a single ordered path, why reads are served at the tail, and what the head and tail failures require of the membership protocol. filesystems · advanced
- Sep 5, 2025 Splitting a Change into Units That Can Be Reviewed Independently Why the unit of review should be a reversible intent rather than a file or a commit, how mixed changes produce review deadlock, and what splitting costs in history. software engineering · foundational
- Sep 5, 2025 What a Notebook File Stores and What It Omits The version 4 notebook schema keeps source, rendered output, and a little kernel metadata in one JSON document, and drops the environment, the inputs, and the process that produced it. scientific computing · foundational
- Sep 4, 2025 Event Notification and Event-Carried State Transfer Compared Two events can carry the same name and different obligations: one says a fact changed and leaves the state behind, the other carries the state. The choice sets coupling, ordering needs, and deduplication cost. software architecture · foundational
- Sep 4, 2025 Randomized Rounding of Linear Programs into Integer Solutions How solving a linear relaxation and rounding each variable by its own probability produces integer solutions whose expected cost is within the relaxation bound, and where the argument needs repair. algorithms · advanced
- Sep 4, 2025 Sparse Sampling and the Limits of Recovery Why a sub-Nyquist sample count can still determine a sparse signal, what the restricted isometry property guarantees, and where the guarantee stops being useful. scientific computing · advanced
- Sep 4, 2025 Why Larger Keys Do Not Answer the Quantum Threat Shor’s algorithm attacks the group structure rather than the key length, so every classical public-key family falls together; what a replacement primitive has to provide and where migration actually costs. cryptography · advanced
- Sep 3, 2025 Agglomerative Clustering and the Lance-Williams Recurrence Bottom-up merging needs one rule for the distance between two groups of points; the Lance-Williams update is the shared arithmetic behind single, complete, average, and Ward linkage, and it decides which hierarchies are order preserving. machine learning · foundational
- Sep 3, 2025 High-Level Synthesis: Scheduling, Binding, and the Latency-Area Trade How a C-level description becomes a datapath through dependency scheduling and resource binding, why the loop and array decisions dominate the result, and where the generated hardware diverges from the source. hardware engineering · advanced
- Sep 3, 2025 Spill Cost Heuristics and the Choice of Victim How allocators price a virtual register in loads and stores, why the cost-to-degree ratio is the wrong objective in loops, and what the reload placement problem looks like after spilling. compilers · intermediate
- Sep 3, 2025 Strided, Indexed, and Gather Memory Access Why contiguous vector loads map onto ordinary cache lines while strided and indexed accesses turn into many element transactions, and where the memory system stops being able to keep a vector unit fed. computer architecture · advanced
- Sep 2, 2025 Alphabets, Strings, and the Closure Properties That Define a Language Class Why formal languages are studied as sets of strings, how closure under composition operations determines what a class can express, and why descriptions rather than sets carry the theory. computation theory · foundational
- Sep 2, 2025 Metadata Filtering Inside Vector Search Why post-filtering a top-k list cannot satisfy a restrictive predicate, how pre-filtering collapses an index walk, and what the middle strategies actually cost. inference systems · intermediate
- Sep 2, 2025 Prefix Caching and Shared Residency Deduplicating key-value blocks across requests that begin with the same tokens, how blocks are matched by hash, and what eviction must preserve. inference systems · intermediate
- Sep 2, 2025 Progress Guarantees and the Lock-Free Hierarchy The difference between obstruction-free, lock-free, and wait-free, why lock-free does not mean no locks, and how helping makes a single-word operation wait-free. systems programming · advanced
- Sep 1, 2025 Autofill Tokens and the Purpose of an Input How the autocomplete attribute encodes what a field means, how browsers and assistive technology consume it, and why the token set is a closed vocabulary. accessibility · foundational
- Sep 1, 2025 kexec and Crash Dumps: Capturing a Dead Kernel Booting a second kernel from the first, reserving memory that survives the handover, and why the dump kernel must not touch the crashed one's state. operating systems · advanced
- Sep 1, 2025 Training-Serving Skew and the Contract Between Features and Models How the same feature computed in two code paths diverges, why the split is structural rather than a bug, and which checks catch the drift before a model ships. machine learning · foundational
-
August
Aug 31, 2025 Cuckoo Hashing and the Guarantee of Two Probes How two hash functions and a displacement rule give worst-case constant lookup, why insertion can cycle, and how a stash or a larger bucket count makes it succeed. data structures · advanced - Aug 31, 2025 Hermetic Builds: Isolating the Network, the Clock, and the Filesystem A build that can read the network, the clock, or the ambient filesystem is not a function of its source. Isolation removes those channels and makes the input set explicit. security · advanced
- Aug 31, 2025 Spot Capacity and the Price of Interruption How interruptible capacity is priced, why the discount is compensation for a termination notice, and how checkpoint interval trades against lost work. cloud infrastructure · advanced
- Aug 30, 2025 Attaching Foreign Threads to a Managed Runtime What a runtime needs from a thread before managed code can run on it, why a library-spawned worker thread has none of it, and how attach and detach bracket the transition. language runtimes · advanced
- Aug 30, 2025 Destructors, Drop Order, and What Unwinding Actually Runs The order in which destructors run, how exception propagation finds them, and why a destructor that throws or panics changes the shape of the program. programming languages · intermediate
- Aug 29, 2025 Bit-Reproducible Builds and Nondeterministic Actions The specific places nondeterminism enters a compile and an archive, the flags that normalise them, and why a byte-identical rebuild is a prerequisite for trusting a shared cache. developer tools · advanced
- Aug 29, 2025 Direct Volume Rendering and the Opacity Correction Nobody Applies How ray casting accumulates colour and opacity along a ray, why a transfer function tuned at one step size breaks at another, and where pre-integrated classification changes the answer. scientific computing · intermediate
- Aug 29, 2025 Incident Roles and the Status Update Cadence Why the person with the most context should not be the one coordinating, how the commander, operations, and communications roles divide the work, and what a status update owes its readers. devops · advanced