Complete archive
Archive
3,240 articles, newest first · page 40 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.
-
2024
Aug 2, 2024 Event Propagation: The Path, the Three Phases, and the Stop Flags Dispatch walks a path computed before any listener runs, invoking capture listeners downward and bubble listeners upward, with separate flags for stopping traversal and cancelling the default action. web platform · foundational - Aug 1, 2024 Fixture Isolation and the Cost of Shared Test State How ordering dependencies and leaked state turn a suite into a fragile sequence, and the four isolation strategies that restore independence at different prices. software engineering · intermediate
- Aug 1, 2024 Growth Policies in Dynamic Arrays and What the Allocator Does With Them Why doubling beats incremental growth, how realloc can extend a buffer in place, and which costs a growth policy actually controls. data structures · foundational
- Aug 1, 2024 The Read Phenomena Ladder and What Each Isolation Level Still Permits Why the four SQL isolation levels are defined by the anomalies they forbid rather than the guarantees they give, and which anomalies fall through the definitions. databases · foundational
-
July
Jul 31, 2024 Linear Probing and the Arithmetic of Primary Clustering Why probing consecutive slots produces runs of occupied cells, how those runs change the expected probe count, and how backward-shift deletion repairs a probe chain. data structures · foundational - Jul 30, 2024 If-Conversion, Predication, and the Limits of Speculation How conditional branches become data dependences on a predicate, when that is profitable, and why the transformation must respect faults, exceptions, and the register file. compilers · advanced
- Jul 29, 2024 Composing a Parallelism Layout From a Memory and Bandwidth Budget Data, tensor, pipeline, and shard dimensions interact non-linearly. A procedure for choosing their sizes from per-device memory, interconnect tiers, and batch constraints. deep learning · advanced
- Jul 29, 2024 Principal, Interest, and Upkeep in the Technical Debt Model What the debt metaphor actually quantifies: a one-time restoration cost, a recurring surcharge on future changes, and the arithmetic that decides whether repayment ever pays. software architecture · foundational
- Jul 26, 2024 Network Namespaces and veth Pairs as Virtual Routers How a Linux network namespace holds an independent forwarding table, how veth pairs connect two of them, and what a packet crossing between namespaces actually costs. networking · intermediate
- Jul 26, 2024 Queueing Delay and the Cost of Service-Time Variance Why waiting time depends on variance rather than only on mean load, how the M/M/1 and M/G/1 results express that dependence, and what reducing variance buys. backend systems · intermediate
- Jul 25, 2024 IPv6 Forwarding, Extension Header Chains, and Scoped Addresses How a fixed forty-byte header pushes options into a chain a router must walk, why scopes are part of the address, and which rules a forwarder applies differently than in IPv4. networking · intermediate
- Jul 24, 2024 What a Namespace Isolates and What It Leaves Shared The eight namespace types, the resources each one partitions, and the state that stays global no matter how many namespaces a process joins. virtualization · intermediate
- Jul 23, 2024 Divergence Amplification in Nested Control Flow Why nesting multiplies serialized path count rather than adding to it, how the mask stack depth bounds what the hardware can track, and which rearrangements collapse the product. gpu computing · advanced
- Jul 23, 2024 Model Artifact Identity: Why a Checkpoint Hash Is Not a Deployment The behaviour a serving fleet exhibits depends on far more than tensor values, so deployment identity has to cover the tokenizer, the preprocessing path, and the runtime configuration as one unit. inference systems · foundational
- Jul 22, 2024 CAN Frame Layout and Why Bit Stuffing Is Mandatory The field-by-field structure of a classical CAN frame, the stuff-bit rule that keeps receivers synchronised, and what each field costs in the worst case. embedded systems · intermediate
- Jul 22, 2024 One Rooted Namespace: How Mounting Replaced Separate Volumes Why Unix names every file under a single root, how mount grafts a filesystem onto a directory, and what the resulting ambiguity costs in path resolution. computing history · foundational
- Jul 22, 2024 Ownership and Borrowing as a Static Lifetime Proof How move semantics, exclusive borrows, and non-lexical lifetimes let a compiler prove that no pointer outlives its referent, and where the proof stops being able to help. memory systems · advanced
- Jul 22, 2024 Tiling Through Shared Memory and Overlapping the Load The reuse arithmetic that decides a tile size, why a register tile on top of a shared tile cuts scratchpad traffic again, and how an asynchronous copy lets the next tile load while the current one is computed. gpu computing · intermediate
- Jul 21, 2024 Rollout Waves and the Arithmetic of Blast Radius How staged deployment divides one risky decision into a sequence of gated ones, why wave size sets the smallest detectable failure rate, and where correlated faults break the model. distributed systems · foundational
- Jul 20, 2024 Why a Seccomp Filter Cannot Inspect Syscall Arguments in Memory The pointer-versus-contents problem in syscall filtering, the race that makes dereferencing unsafe even if it were allowed, and the mechanisms that recover argument-aware policy without it. virtualization · foundational
- Jul 19, 2024 Why Linters Parse: Token Streams, Syntax Trees, and the Cost of Losing Layout How a linter turns source text into tokens and trees, what separates a concrete from an abstract syntax tree, and which checks become impossible once layout is discarded. developer tools · foundational
- Jul 18, 2024 Key Commitment and Why an AEAD Can Decrypt Under Two Keys AEAD schemes are not committing by default, so a ciphertext forged to verify under two different keys splits the receiver into two views of the same message, with consequences for key rotation and message franking. cryptography · advanced
- Jul 18, 2024 The Unbiased Pass@k Estimator for Code Generation Sampling k completions and checking whether any passes is a biased estimate of pass@k. The combinatorial correction, why it is needed, and how variance scales with the sample. inference systems · advanced
- Jul 17, 2024 Read-Modify-Write Hazards in Peripheral Registers Why assigning through a bit-set idiom corrupts registers the hardware also writes, how write-one-to-clear flags interact with that idiom, and what surrogate registers buy. embedded systems · intermediate
- Jul 17, 2024 The Area Budget: Reticle Limits, Yield, and Cost per Die Why a die cannot grow past the lithography field, how defect density makes cost superlinear in area, and what a square millimetre of silicon actually buys. computer architecture · foundational
- Jul 16, 2024 Bisecting a Deploy Range When the Fault Is Not Monotone Binary search over versions and inputs assumes the symptom persists once introduced; what that assumption costs, how delta debugging generalises it, and where the search stops being worth running. observability · foundational
- Jul 16, 2024 State Sufficiency: What the Past Must Leave Behind How to decide which facts about a partial solution a DP state must record, why insufficient states produce wrong answers rather than slow ones, and what each extra dimension costs. algorithms · foundational
- Jul 15, 2024 ECDSA Nonce Reuse and the Private Key It Leaks A repeated signing nonce turns two signatures into a linear system that yields the private key, and biased nonces are nearly as bad because lattice reduction tolerates noise. cryptography · intermediate
- Jul 12, 2024 Cache Flush, FUA, and What a Write Completion Means How a device with a volatile write cache reorders writes, what a flush and a force-unit-access write each promise, and why the barrier is only as good as the drive. filesystems · advanced
- Jul 12, 2024 How the Same-Origin Policy Computes and Compares Origins The origin triple of scheme, host, and port, the opaque origins produced by sandboxing and data URLs, and which browser capabilities the policy actually gates. web platform · foundational
- Jul 12, 2024 Join Cardinality and Where the Containment Assumption Fails How equality joins are estimated from distinct-value counts, why the uniform-frequency assumption collapses on skewed keys, and how the error compounds across a chain of joins. databases · intermediate
- Jul 11, 2024 How a Document Becomes an Accessibility Tree Which DOM nodes a browser exposes to assistive technology, which it discards, and why ignored containers are flattened instead of deleted. accessibility · foundational
- Jul 11, 2024 Importing Existing Resources into a Declarative Configuration What adoption actually writes into state, why a written resource block must match the object before the plan is clean, and where import cannot reach. cloud infrastructure · intermediate
- Jul 11, 2024 Reassociation, Excess Precision, and the Limits of Bitwise Reproducibility Why identical source can produce different bits on two machines, which compiler transformations are responsible, and how ordering or exactness restores a stable result. scientific computing · advanced
- Jul 11, 2024 Release Order at Scope Exit and the LIFO Cleanup Rule Why destructors, defer statements, and scope guards run in reverse order of acquisition, and which ordering guarantees survive partial construction and unwinding. systems programming · foundational
- Jul 10, 2024 Error Models Across REST, gRPC, and GraphQL How each style encodes failure, why status-code categories are not enough, and how a client decides whether an error is safe to retry. backend systems · advanced
- Jul 10, 2024 Focus Rings, :focus-visible, and the Heuristic Behind Them Why browsers began suppressing focus indicators on mouse clicks, how the :focus-visible heuristic decides, and what a custom indicator must do to survive forced-colors mode and clipping. accessibility · foundational
- Jul 10, 2024 Gini, Entropy, and Why Misclassification Error Cannot Grow a Tree Three impurity functions look interchangeable, but only the strictly concave ones produce a useful ranking of splits. A worked partition shows where the third fails. machine learning · foundational
- Jul 10, 2024 VLIW Bundles and the Compiler as Scheduler How very long instruction word machines move dependence checking and slot assignment into the compiler, what that buys in hardware, and why exposed pipeline latency and binary compatibility make the trade expensive. computer architecture · foundational
- Jul 9, 2024 Bootstrapping a Self-Hosted Compiler and Why the Build Is Compared Against Itself A compiler written in its own language cannot be built from nothing. Three-stage bootstrapping solves the chicken-and-egg problem and turns the second and third stages into a self-check of the whole toolchain. compilers · advanced
- Jul 9, 2024 Click Features and Position Bias in Ranked Lists Why a click at rank one means something different from a click at rank nine, how examination models correct for it, and what inverse propensity weighting costs. information retrieval · intermediate
- Jul 9, 2024 Memory Channel Interleaving and the Granularity Trade Why physical addresses are striped across memory channels at cache-line granularity, how the hash decides which channel owns an address, and what that choice costs for sequential and strided access. hardware engineering · intermediate
- Jul 6, 2024 Clock Sources, Clock Events, and the Tick The two abstractions behind kernel time: hardware that can be read for a timestamp, hardware that can raise an interrupt at a chosen moment, and the periodic tick built from the second. operating systems · intermediate
- Jul 6, 2024 Retransmission Timeout Estimation and Karn's Algorithm Why the retransmission timer is computed from a smoothed round-trip estimate plus a variance term, and why timing a retransmitted segment corrupts the estimate. networking · foundational
- Jul 5, 2024 Deprecation Windows and the Machinery Behind Compatibility Shims How an old interface is kept working while its replacement is adopted, what a shim must translate, and how to decide when removal is safe rather than merely scheduled. devops · advanced
- Jul 5, 2024 Memory Tagging and the Granule Trade-Off How a tag in the pointer and a tag in memory turn a stale or out-of-bounds access into a fault, why the granule size decides which bugs are visible, and what probabilistic checking buys. memory systems · advanced
- Jul 5, 2024 Virtual Runtime and Weighted Fair Queuing Why fair schedulers compare virtual clocks rather than wall time, how nice values become weights, and what granularity does to the fairness guarantee. operating systems · intermediate
- Jul 5, 2024 Windowed Watchdogs and the Program-Flow Contract Why a watchdog that accepts a refresh too early is as dangerous as one that never fires, how the window and the sequence check constrain the timing, and where the supervision must live to be independent. embedded systems · foundational
- Jul 4, 2024 Loss-Scale Dynamics and Spike Detection in Mixed Precision Why a fixed loss scale cannot serve both the largest and smallest gradients in a run, how dynamic scaling detects overflow, and what happens to optimizer state when a step is skipped. deep learning · advanced
- Jul 4, 2024 Wiring Error Messages to Their Fields How aria-describedby, aria-invalid, and aria-errormessage bind a message to a control, and how the accessibility tree orders what the user hears. accessibility · intermediate
- Jul 3, 2024 Physical Operator Selection and Access Path Mechanics What distinguishes a sequential scan from an index scan, a bitmap heap scan from an index-only scan, and how each access path decides when to stop reading. databases · intermediate
- Jul 1, 2024 Interpolation Search and What Uniform Key Distribution Buys How probing by estimated position turns logarithmic search into log-log search, the exact arithmetic it needs, and the degenerate inputs that make it linear. algorithms · foundational
-
June
Jun 29, 2024 pidfd: A Process Handle That Cannot Be Reused A process id is recycled the moment a process is reaped, so any operation addressed by pid can hit an unrelated process. A pidfd refers to the process object itself and closes the race. systems programming · advanced - Jun 28, 2024 Predication and Branch Selection When a compiler converts a conditional into predicated instructions or a select, and the cost comparison that decides whether branching or straight-line code is cheaper for a warp. gpu computing · intermediate
- Jun 28, 2024 Store Buffers and the x86-TSO Model How a per-core write buffer leaves store-load as the only program-order pair that may invert, why forbidding it would defeat the buffer, and what a locked instruction orders. memory systems · foundational
- Jun 28, 2024 Template Ownership When Scaffolding a New Service A generator produces a fork of the template the moment it runs. What that implies for update paths, three-way merges, and the split between generated and referenced configuration. devops · intermediate
- Jun 27, 2024 Crosstalk: Mutual Capacitance, Mutual Inductance, and Coupling Length The two coupling mechanisms that inject noise into a neighbouring trace, why near-end and far-end crosstalk behave differently, and how spacing and layer choice change the balance. hardware engineering · intermediate
- Jun 27, 2024 Deriving Latency Targets from Percentile Distributions Why a percentile objective is really a tail-count budget, how bucket layout limits the achievable precision, and what a latency target costs in headroom. observability · intermediate
- Jun 27, 2024 io_uring: Shared Rings, Submission Entries, and Completion Ordering How a submission queue and a completion queue are mapped into the process, what the two barriers protect, and why a batched interface changes the cost of a system call. systems programming · advanced
- Jun 27, 2024 The Primal-Dual Schema: Dual Variables as a Certificate How charging primal costs against a feasible dual solution yields approximation guarantees for facility location and prize-collecting problems, without solving an LP. algorithms · advanced