Complete archive

Archive

3,240 articles, newest first · page 11 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
May 20, 2026 A-Stability and the Dahlquist Barrier Why the second Dahlquist barrier limits linear multistep methods to order two when they must damp every decaying mode, and how the equivalent restrictions apply to Runge-Kutta schemes. scientific computing · intermediate
May 20, 2026 Dynamic Shapes, Guards, and the Cost of Recompilation A compiled kernel needs concrete extents; symbolic shapes force either a general kernel, a bucket, or a recompile, and each choice moves cost to a different place. inference systems · intermediate
May 20, 2026 Growing and Ageing a Filter Without Rebuilding It Scalable Bloom filters add slices with tightening error instead of rehashing, and decaying sketches replace deletion with a time constant that bounds the effective window. data structures · advanced
May 20, 2026 How Power Density and Pin Count Decide the Package How power density, inductance, and thermal expansion decide between wire bond, flip-chip, and wafer-level packaging, and which of the three is usually the binding constraint. hardware engineering · intermediate
May 19, 2026 Ordering Constraints in the First Thousand Instructions Clock sources, flash wait states, external memory controllers, and the floating-point unit all have prerequisites, so the startup sequence is a dependency graph rather than a list. embedded systems · advanced
May 19, 2026 The Evidence Lower Bound as a Latent Variable Objective How the intractable marginal likelihood of a latent variable model is split into a reconstruction term and a KL term, and what each term pushes the encoder to do. deep learning · foundational
May 19, 2026 What write() Actually Does Before Data Leaves the Process How a buffered write lands in the page cache as dirty pages, when the kernel begins writing them back, and why the call returning does not mean the bytes are on the device. performance engineering · foundational
May 18, 2026 Error Budget Policy: Freezes, Exemptions, and Escalation Arithmetic How a budget becomes an enforceable rule, why a freeze that everyone can override is worse than none, and how exemption quotas are computed from the budget itself. observability · intermediate
May 18, 2026 Open Addressing, Probe Sequences, and the Cost of Deletion Why open-addressed tables store keys in the slot array, how a probe sequence defines lookup, and why deletion requires tombstones or backward shifting. data structures · foundational
May 18, 2026 The Instance Credential Chain and What the Metadata Service Exposes How a virtual machine obtains role credentials without a stored secret, why network reachability becomes identity, and how the request-side defences work. cloud infrastructure · intermediate
May 17, 2026 Bitmap Index Scans and the Order of Heap Fetches Why a plan collects row identifiers into a bitmap before fetching rows, how the bitmap is compressed and ordered, and when losing row order is acceptable. databases · advanced
May 17, 2026 How Firmware Describes Physical Memory to the Kernel The E820 and UEFI memory map formats, why reserved ranges outnumber usable ones, and how the kernel turns a list of address ranges into its own page allocator. operating systems · foundational
May 17, 2026 Query-Time Cost and the Conjunctive Fast Path What dominates the latency of a term-based query, how a conjunction of rare and common terms is evaluated, and where the unavoidable costs of scoring live. information retrieval · intermediate
May 16, 2026 Compare-and-Swap and Why the Retry Loop Must Re-read How a conditional store becomes a universal synchronisation primitive, why weak compare-and-exchange may fail spuriously, and what makes a CAS loop terminate. systems programming · foundational
May 16, 2026 Evaluation Order, Sequencing Points, and Unspecified Behaviour Why C leaves the order of operand evaluation open, which operators impose sequencing, and how a language that fixes left-to-right evaluation pays for the guarantee. programming languages · intermediate
May 16, 2026 Lockfiles: Recording the Resolved Graph Without Re-Resolving It What a lockfile stores beyond version numbers, how it stays consistent with the manifest, and why regeneration is a different operation from installation. software engineering · foundational
May 16, 2026 The TLS 1.3 Key Schedule: Extract, Expand, and Why Order Matters How HKDF turns one shared secret into six traffic secrets, what the transcript hash does at each stage, and why early secrets are derived before the peer is authenticated. internet protocols · intermediate
May 16, 2026 Tweakable Encryption with XTS and the Limits of Length-Preserving Disk Encryption How sector encryption binds ciphertext to its disk location without expanding it, why XTS carries no integrity and what that permits an attacker with write access, and how tweak and key layout are fixed by the standard. cryptography · advanced
May 15, 2026 Bidirectional Checking: When a Type Is Synthesized and When It Is Checked How splitting the typing judgment into synthesis and checking makes annotated lambdas and empty literals typable without a global constraint solver, and where the split loses completeness. compilers · advanced
May 15, 2026 Design Rules as an Encoding of Process Limits Why a process rule deck is layer-pair specific, how width, spacing, and enclosure numbers derive from lithography and etch capability, and what a design rule checker can and cannot prove about a layout. hardware engineering · foundational
May 15, 2026 One-Shot Watches and the Changes That Fall Between Them How watch registration, firing, and re-registration create a gap, why the client must re-read rather than trust the event, and what a lost notification actually means. distributed systems · intermediate
May 15, 2026 Shrinking Footprint with Narrow Handles and Inline Storage How pointer-width reduction, index handles, and inline small-object storage cut the bytes a traversal must move, and what each technique costs in indirection. performance engineering · advanced
May 15, 2026 SSA Construction and the Cost of Phi Placement Dominance frontiers decide where phi nodes belong, minimal SSA places too many of them, and pruning by liveness is what keeps the form small enough to optimize. compilers · foundational
May 14, 2026 Keeping a Vector Index Current Without Rebuilding It How segments, tombstones, and compaction let an index absorb edits, why deletion is more expensive than insertion, and where the visible-lag window comes from. inference systems · advanced
May 14, 2026 Slab Caches and Per-CPU Magazines for Fixed-Size Objects How object caches amortise construction and keep hot free objects in per-CPU lists, why the magazine layer exists, and when an empty slab can be returned to the page allocator. memory systems · intermediate
May 13, 2026 Boundary Tags and Coalescing in a Free-List Heap How a heap finds the neighbours of a freed block using headers at both ends, why coalescing is necessary for reuse, and what the deferred variants cost in latency. memory systems · foundational
May 13, 2026 Channel Packing: Which Data Belongs in Which Channel Why roughness, metallic, ambient occlusion, and height share one texture, how the choice of channel is constrained by compression, and what breaks at the seams. computer graphics · intermediate
May 13, 2026 Misprediction Recovery: Checkpoints, Squash, and the Cost of Being Wrong How an out-of-order core unwinds speculative state when a branch resolves wrong, why checkpoints of the rename map beat walking a reorder buffer, and what limits recovery speed. computer architecture · intermediate
May 13, 2026 Realms, Cross-Realm Identity, and Errors That Cross Boundaries Each global object carries its own set of intrinsics, so objects from an iframe or worker fail instanceof checks while remaining fully usable and holding their realm alive. web platform · advanced
May 13, 2026 Static Branch Prediction and the Branch Delay Slot How compilers and instruction sets answered the control hazard before dynamic predictors existed, and why delay slots were abandoned once pipelines got deeper. computer architecture · foundational
May 13, 2026 Status Codes, Interim Responses, and When a Response Has No Body How the three-digit status code steers client behaviour, why 1xx responses break naive parsers, and which statuses forbid or require a body. internet protocols · foundational
May 13, 2026 The Reorder Buffer and In-Order Retirement How entries move through the reorder buffer from allocation to commit, why retirement order is what makes speculative and out-of-order execution safe, and what limits the buffer size. computer architecture · foundational
May 12, 2026 Butcher Tableaux and the Order Conditions of Runge-Kutta Methods How a Runge-Kutta scheme is encoded in a tableau, which algebraic relations among its coefficients produce each order of accuracy, and why the condition count grows so fast. scientific computing · intermediate
May 12, 2026 Hidden Classes and Inline Caches in Dynamic Object Models How a runtime gives dictionary-shaped objects a fixed layout, why each property access site remembers its last hit, and when the cache is invalidated. programming languages · intermediate
May 12, 2026 How Deep to Evaluate: Analysis Cost Against Rework Cost Choosing the depth of an evaluation from the reversibility of the decision, the cost of undoing it, and whether the answer would change what anyone does next. software architecture · intermediate
May 12, 2026 Injecting Failures at the RPC Boundary: Codes, Timeouts, and Resets Why the shape of an injected failure decides the caller behaviour it provokes, how deadlines and retries multiply load, and what circuit breaker states actually reveal under injection. devops · intermediate
May 12, 2026 Interior Mutability and the Runtime Borrow Flag How a language that checks aliasing at compile time permits mutation through a shared reference, what the runtime flag costs, and how it fails at runtime instead of at compile time. programming languages · intermediate
May 12, 2026 Signal Delivery, Thread Masks, and Which Thread Runs the Handler How the kernel chooses a thread for a process-directed signal, why the mask is per thread while the handler is shared, and where the choice becomes deterministic. operating systems · intermediate
May 12, 2026 The TLS Record Layer: Framing, Fragmentation, and Sequence Numbers How application bytes become protected records: the five-byte header, the 16 KiB fragment limit, implicit sequence numbers, and how the AEAD nonce is assembled. internet protocols · foundational
May 11, 2026 Space Complexity Accounting for Recursion, Auxiliary Buffers and Output Stack depth, explicit work arrays and output storage are three separate memory costs, and the convention for counting them decides whether an algorithm is called O(1) space, O(log n) or O(n). algorithms · intermediate
May 11, 2026 The Effective Window: Congestion Window, Receive Window, and Buffers Why three independent limits govern how much a TCP sender may have outstanding, how the congestion window grows and collapses, and which limit binds in practice. networking · intermediate
May 11, 2026 Version Vectors and Conflict Detection in Multi-Writer Replication How per-replica counters encode causal history, why vector comparison identifies concurrency that timestamps hide, and what the vectors cost in metadata and pruning. distributed systems · intermediate
May 10, 2026 Page Compression: Prefix, Dictionary, and the Cost of Decoding How prefix truncation, shared dictionaries, and byte-level encoding shrink a page, why decompression sits on the critical path, and where compression defeats the buffer pool. databases · advanced
May 9, 2026 User-Mode Emulation and binfmt_misc for Foreign Binaries How a binary for another architecture starts on a host kernel at all, which parts of its execution the emulator rewrites, and the behaviours that stop being faithful once it does. systems programming · intermediate
May 9, 2026 What an Admission Webhook Can and Cannot Decide The position of admission control in the write path, the fields a webhook receives, and why cross-object invariants and external state cannot be enforced there. devops · foundational
May 8, 2026 Bandwidth-Bound and Latency-Bound Work How to tell which of the two memory limits a kernel is actually hitting, why the remedy differs completely, and how the arithmetic intensity decides. performance engineering · advanced
May 8, 2026 Differential Signalling, Common-Mode Rejection, and Where to Put the Terminator Why a twisted pair driven in opposition rejects ground noise, how termination absorbs reflections, and why the correct value is set by the cable rather than the transceiver. embedded systems · intermediate
May 8, 2026 Leveled Compaction and the Shape of the LSM Tree Why leveled compaction keeps each level ten times the size of the one above, what that costs in write amplification, and how tiering trades it back. databases · intermediate
May 8, 2026 Splitting Footprint by Mapping Type: Anonymous, File-Backed, and Special How a process address space divides into anonymous, file-backed, and special mappings, what each contributes to footprint, and how to read the permission and label fields that identify them. memory systems · advanced
May 7, 2026 Radix Trees over Fixed-Width Integer Keys Indexing by bit fields instead of by bytes turns a trie into a fixed-height array of tables. Why integer radix trees need no rebalancing, how their height is computed, and where they lose to hash tables. data structures · intermediate
May 6, 2026 Data Validation at Pipeline Boundaries Schema checks, value constraints, and distribution assertions that stop corrupt data before it reaches training, and what each class of check costs. machine learning · intermediate
May 5, 2026 Early RTCP Feedback: Negative Acknowledgements, Picture Loss, and Transport Congestion How the feedback profiles let a receiver report loss in milliseconds instead of seconds, what each message type asks for, and the timing rules that keep them from flooding a session. internet protocols · intermediate
May 5, 2026 Pareto Frontiers and Cost-Benefit Ranking of Architecture Options Filtering design options by dominance before anyone assigns weights, then comparing the surviving few on marginal cost per unit of quality gained. software architecture · advanced
May 5, 2026 POSIX Mode Bits, umask, and the ACL Mask Interaction How the nine permission bits, the setuid and sticky bits, umask filtering, and POSIX ACL entries combine into one effective permission, and why chmod rewrites an ACL mask. security · foundational
May 5, 2026 Register File Ports and Operand Delivery Why each extra read port on a register file costs area, latency, and energy, how banking and replication spread the cost, and what late operand collection buys a wide-issue machine. computer architecture · intermediate
May 5, 2026 Run Queues and the Cost of a Context Switch How the kernel tracks which threads can run, why each CPU keeps its own queue, and what a switch actually costs beyond saving and restoring registers. operating systems · foundational
May 5, 2026 Total-Order Broadcast: One Order for Every Replica Why a single sequencer turns concurrent updates into a deterministic log, what the ordering guarantee costs in latency and availability, and how the order survives a sequencer failure. distributed systems · advanced
May 4, 2026 Lease Safety Margins Under Clock Drift The arithmetic that keeps a lease from being granted twice: how offset error, drift rate, and timer resolution set the gap between the client deadline and the server reassignment. distributed systems · advanced
May 4, 2026 Load-Store Ordering and Memory Disambiguation in a Speculative Machine Why loads may run ahead of stores, how the memory order buffer checks addresses it does not know yet, and what happens when a load guesses wrong. computer architecture · intermediate
May 4, 2026 PCI Passthrough and the Boundaries an IOMMU Actually Draws Why handing a GPU to a guest requires an isolation unit that no sibling device can bypass, and what changes when the device caches its own translations. gpu computing · foundational

2026