Complete archive
Archive
3,240 articles, newest first · page 16 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.
-
2026
Feb 22, 2026 Layer Cache Keys and What Makes a Build Reproducible Why two builds of the same source produce different layer digests, which inputs a build cache actually keys on, and how instruction ordering changes both reuse and image size. virtualization · intermediate - Feb 22, 2026 Statement Versus Row-Based Logs: Determinism and the Cost of Replay How statement replication breaks on nondeterministic SQL, what row images cost in bytes, and which failures each format survives. databases · foundational
- Feb 22, 2026 Two-Operand Encodings and the Destructive Write Problem Why the second source register disappears in a two-operand format, how destructive writes constrain register allocation, and what a three-operand format buys back. computer architecture · intermediate
- Feb 20, 2026 Amdahl's Law and the Serial Fraction That Caps Speedup Why a fixed serial portion of a workload bounds speedup no matter how many processors are added, how to estimate that fraction, and where the law stops describing real scaling. performance engineering · foundational
- Feb 20, 2026 Geometric History Lengths in TAGE Predictors How TAGE uses several tables with exponentially different history lengths, tagged entries, and a usefulness counter to pick the longest matching prediction without collapsing into aliasing. computer architecture · advanced
- Feb 20, 2026 Memory Redundancy and Repair: Turning Defective Arrays into Working Parts How spare rows and columns, fuse or antifuse programming, and built-in self-repair convert a memory array with dozens of defects into a passing die, and when the spare budget runs out. hardware engineering · advanced
- Feb 20, 2026 Policy as Code: Decision Engines and Deterministic Evaluation How a general-purpose policy engine turns rules into a decision, why partial evaluation produces residual queries, and what non-determinism costs an authorization system. security · intermediate
- Feb 20, 2026 Rebase as Patch Replay and Why Every Id Changes How rebase computes the commits to replay, why the new commits are not the old ones, and what information the replay cannot carry across. software engineering · intermediate
- Feb 20, 2026 Reproducible Builds: The Sources of Nondeterminism in Compiler Output Two builds of identical source differ because something in the environment leaked into the artifact. The taxonomy of those leaks, and the normalizations that remove them. security · intermediate
- Feb 20, 2026 The Dictionary Object Model and the Cost of a Name Lookup How a dynamically typed object resolves a property name through a per-object table, what a single access costs in instructions and bytes, and which conditions must hold before the lookup can become a fixed offset. language runtimes · foundational
- Feb 19, 2026 Position Bias in Pairwise Preference Judging When a judge compares two responses, the order they appear in changes the verdict. Measuring the effect requires swapping the pair and reading the disagreement rate. inference systems · intermediate
- Feb 17, 2026 Checksum Verification and Restore Drills Distinguishing repository integrity from data verification and from a real restore, how much sampling is statistically worth doing, and what no checksum can detect. devops · intermediate
- Feb 17, 2026 Designing for the Tails of an Ability Distribution, Not the Mean Why a design calibrated to an average body or an average user excludes most people, and how percentile bands and requirement envelopes replace the average as a design input. accessibility · foundational
- 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 · advanced
- Feb 17, 2026 Peephole Optimization and the Sliding Window How local rewrites over a small instruction window remove redundant loads, collapse moves, and turn compare-and-branch pairs into single instructions, and where the window size stops helping. compilers · intermediate
- Feb 17, 2026 Read-Copy-Update: Publishing New Versions and Waiting Out Old Readers How RCU lets readers run without any synchronization instruction at all, what a grace period must prove before memory can be freed, and where the approach stops working. operating systems · advanced
- Feb 17, 2026 Steal Time and vCPU Skew: What Happens When a Guest Gets Fewer Cores Than It Asked For Why a guest cannot see its own descheduling, how paravirtualized steal accounting reports it, and why lock holders that lose the CPU cost far more than the time they lost. virtualization · advanced
- Feb 17, 2026 Structured Clone Across Storage Boundaries What the structured clone algorithm keeps when a value enters IndexedDB or crosses to a worker, which types it refuses, and how transfer differs from copying. web platform · advanced
- Feb 16, 2026 Accessible Name Computation: Which Attribute Wins aria-labelledby, aria-label, label elements, alt text, and element content are consulted in a fixed order. The order, the recursion rules, and the roles that refuse a name entirely. web platform · intermediate
- Feb 16, 2026 Actor Mailboxes, Supervision, and the Limits of Location Transparency An actor owns its state and processes one message at a time, which removes data races but not unbounded queues. How supervision trees, delivery guarantees, and selective receive shape real behaviour. software architecture · advanced
- Feb 16, 2026 Worst-Case Execution Time Analysis and What the Bound Is Worth Why a measured maximum is not a worst case, how static analysis bounds a path through the control-flow graph, and which microarchitectural features make the bound pessimistic or unobtainable. embedded systems · advanced
- Feb 15, 2026 Latent Diffusion and the Cost of Compressing Before Generating How moving the diffusion process into a compressed latent space changes the compute budget, what the autoencoder bottleneck removes, and which losses it silently introduces. deep learning · advanced
- Feb 14, 2026 How Coverage Tools Count Executed Lines and Branches Tracing hooks versus compile-time counters, why line, statement, branch, and region coverage have four different denominators, and how profiles from many processes are merged. developer tools · intermediate
- Feb 14, 2026 Replaying Logged Traffic to Evaluate a Candidate Offline Recording request and response pairs makes it possible to score a new model against decisions that were already made, but replay is only valid when the candidate sees the same context the incumbent saw. inference systems · advanced
- Feb 14, 2026 String Encoding and Buffer Ownership at the FFI Boundary Why passing a string across a language boundary requires agreeing on encoding, termination, and allocation, and how the two-call pattern avoids guessing at buffer sizes. language runtimes · intermediate
- Feb 14, 2026 The C Calling Convention as an Interoperability Contract How arguments, return values, and stack alignment are encoded at a call site, and why extern C is a narrower promise than most callers assume. language runtimes · foundational
- Feb 13, 2026 io_uring and Shared-Memory Submission Queues How a pair of ring buffers mapped into the process removes most system calls from an I/O path, and which costs remain once the traps are gone. operating systems · advanced
- Feb 13, 2026 Tweakable Block Ciphers and the Cost of Sector Independence How a public tweak makes one key behave like many, why the tweak must enter before the first round, and what XTS and Threefish give up to get it. cryptography · advanced
- Feb 12, 2026 From Page Fault to Signal: How SIGSEGV and SIGBUS Differ The kernel path that turns a bad memory access into a signal, why a missing mapping and an unbacked page produce different signals, and what siginfo tells a handler. systems programming · foundational
- Feb 12, 2026 Parallel Prefix Scan: Hillis-Steele Versus Blelloch Two scan algorithms with the same span class and different work, the up-sweep and down-sweep that make Blelloch work-optimal, and the arithmetic that decides between them. algorithms · intermediate
- Feb 12, 2026 Scattered Data Interpolation and the Conditioning of Radial Basis Functions Why meshless reconstruction solves a dense linear system, how the kernel choice decides between smoothness and conditioning, and what local stencils recover at a fraction of the cost. scientific computing · intermediate
- Feb 12, 2026 The Anatomy of a Virtual Instance: vCPU Threads, Guest Memory, and Device Models What an instance is composed of beneath the API: a set of host threads, a second-level page table, and a set of emulated or shared devices. cloud infrastructure · foundational
- Feb 12, 2026 The Verification Split: Why a MAC Cannot Settle a Dispute Symmetric tags and public-key signatures differ in who is able to check them, and that single difference determines what each can be used as evidence for. cryptography · foundational
- Feb 11, 2026 The Floppy Sector Interface as a Lossy Abstraction How a disk controller invented to address one track at a time became the universal disk interface, and why the geometry, translation and sector-numbering decisions made for it still surface in firmware and partition tables. computing history · intermediate
- Feb 11, 2026 Trap-and-Emulate: The Popek-Goldberg Conditions and Sensitive Instructions Why a guest kernel running without real privilege can still appear to control the machine, which instructions break that illusion, and how the 1974 virtualization theorem decides where traps must land. virtualization · foundational
- Feb 10, 2026 Join Order Search and the Explosion of the Plan Space Left-deep and bushy trees, why the search is NP-hard, and the pruning rules that keep a twenty-table join tractable. databases · intermediate
- Feb 10, 2026 Paged KV Cache Allocation and the Block Table Why reserving contiguous cache for a worst-case output length caps batch size, and how fixed-size blocks with an indirection table remove most of that waste. inference systems · foundational
- Feb 10, 2026 Why Majority Quorums Intersect and What the Intersection Buys The arithmetic of quorum overlap, why read and write sets must share a node, and what asymmetric quorum sizes cost in latency, durability, and fault tolerance. distributed systems · foundational
- Feb 9, 2026 Address Translation Across Host and Device A GPU access may traverse three translation stages, and where the stages live determines whether a shared address space is cheap, whether faults are recoverable, and what a migration can move. gpu computing · advanced
- Feb 9, 2026 Forwarding Paths and the Load-Use Stall That Survives Them How bypass multiplexers supply an ALU result to a consumer before write-back, why a load cannot be forwarded the same way, and how the one-cycle bubble is detected. computer architecture · foundational
- Feb 9, 2026 Mini-Dimensions and Junk Dimensions: Narrowing a Wide Fact Table How to keep fast-changing attributes out of a versioned dimension, and how to collapse a handful of low-cardinality flags into one key instead of a dozen foreign keys. data engineering · intermediate
- Feb 8, 2026 Capability Negotiation Across Architectures Choosing a backend and a kernel variant at load time: what to query, how to key a selection cache, and where feature detection diverges from the specification. gpu computing · advanced
- Feb 8, 2026 Instruction Trace: Funnels, Packet Formats, and Reconstructing Execution How an on-chip trace unit compresses executed addresses into packets, why the trace is not a log of instructions, and what a decoder must infer from partial data. embedded systems · advanced
- Feb 8, 2026 Lifecycle Callbacks and the Process Importance Ranking Why an app receives stopped and destroyed notifications in a fixed order, how the platform derives that order from a ranked list of processes, and which transitions are not reversible. mobile computing · foundational
- Feb 7, 2026 How Shor's Algorithm Turns Factoring into Period Finding Why quantum phase estimation on a modular exponentiation function recovers RSA private keys, and what the circuit cost reveals about which schemes need replacing and which do not. cryptography · foundational
- Feb 7, 2026 Off-CPU Time and Scheduler Delay as a Profile How to attribute the time a thread spends not running, why the stack at the moment of blocking is the right attribution, and what makes off-CPU data heavy-tailed. observability · advanced
- Feb 7, 2026 Relay Arithmetic and the Floating-Point Word in the Zuse Z3 How a two-register stack machine with a 22-bit floating-point word ran at a few hertz, why it had no conditional branch, and what that costs in program length. computing history · intermediate
- Feb 6, 2026 Coarse Quantization with Inverted Files and the nprobe Setting How an inverted-file index reduces a full scan to a few cluster scans, what the centroid training step optimizes, and why the nprobe parameter buys recall at a nearly linear price in work. information retrieval · intermediate
- Feb 6, 2026 Delivery Semantics and Where Duplicates Come From At-most-once, at-least-once, and exactly-once describe the disposition of a single message when an acknowledgement is lost, not a property of the network. backend systems · foundational
- Feb 6, 2026 Streaming APIs: Framing, Backpressure, and Resumption How server-sent events, WebSocket, and gRPC streams delimit messages, what happens when a consumer reads slowly, and how a broken stream resumes. backend systems · advanced
- Feb 6, 2026 The Dangling Else and How Grammars Resolve Ambiguity Why an if-statement grammar is ambiguous, how shift-reduce parsers settle the conflict by default, and what brace-less and indentation-based designs cost instead. programming languages · foundational
- Feb 6, 2026 Virtual Interrupts: APIC Emulation, Interrupt Remapping, and Posted Delivery How a guest programs its own interrupt controller without touching the host's, what the IOMMU must check before a device interrupt is delivered, and why posted interrupts remove the exit from the delivery path. virtualization · advanced
- Feb 5, 2026 Building Basic Blocks and Control-Flow Graphs from Linear Code How leaders split a linear instruction stream into basic blocks, how edges are derived from branches, and which irregularities in real control flow break the simple model. compilers · foundational
- Feb 5, 2026 Connectionist Temporal Classification and Monotonic Alignment How a blank symbol and a collapse rule turn frame-by-frame predictions into a sequence probability, why the sum over alignments needs a lattice recursion, and what the independence assumption costs. deep learning · advanced
- Feb 5, 2026 Guard-Band Clipping and Why Vertices Are Cut Before the Divide Clipping happens in homogeneous space because the perspective divide is undefined behind the eye, and a guard band lets most partially-visible triangles skip the clipper entirely. computer graphics · intermediate
- Feb 5, 2026 ICMP Errors as the Only Feedback Channel for Forwarding Which errors a router is allowed to generate, what it must quote back, and why rate limiting and filtering turn a diagnostic protocol into a silent failure mode. networking · intermediate
- Feb 5, 2026 Loop-Invariant Code Motion and the Conditions It Needs Hoisting an expression out of a loop requires proving it computes the same value on every iteration, and each of the conditions that license it fails in a way that costs correctness rather than speed. compilers · intermediate
- Feb 4, 2026 Clock Gating, Peripheral Enable Order and the Write That Disappears Why a peripheral register write does nothing until its bus clock is enabled, why enabling order matters for parts with dependency chains, and how to diagnose the silent failure. embedded systems · intermediate
- Feb 4, 2026 Prefill and Decode: The Two Cost Curves Behind One Token Price Why the same model spends prefill time on arithmetic and decode time on memory bandwidth, and how that split decides what a token costs to serve. inference systems · foundational
- Feb 4, 2026 Test Discovery, Collection Order, and Import Side Effects How a runner turns files into an ordered list of test cases, why importing a test module executes it, and what that costs in ordering, naming, and reporting. developer tools · foundational