Complete archive

Archive

3,240 articles, newest first · page 31 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
Apr 22, 2025 Detecting Segment Intersections with Orientation Tests How four orientation signs decide whether two segments cross, why the collinear cases need separate handling, and where the all-pairs test stops being affordable. algorithms · foundational
Apr 22, 2025 Idempotency Keys and the Unknown-Outcome Problem How a client-supplied key turns a retried mutation into at-most-once execution, where the key has to be stored, and which failure windows remain open. backend systems · advanced
Apr 22, 2025 In-Doubt Transactions, Held Locks, and Why Timeouts Cannot Help The prepared-but-undecided state that two-phase commit creates, why a participant cannot resolve it locally, and how heuristics and lock timeouts trade atomicity for availability. distributed systems · foundational
Apr 22, 2025 Marking Key Boundaries in a Trie A trie node must distinguish a prefix from a stored key. The terminal marker costs one bit, one child slot, or one pointer depending on layout, and each choice changes lookup and iteration. data structures · foundational
Apr 22, 2025 Move-to-Front Lists and the Working-Set Bound on Sequential Search Reordering a list on every access costs one splice and buys a factor-two competitive bound against any static ordering, with a cost that depends on the access distribution. data structures · advanced
Apr 22, 2025 Query Autocomplete and the Prefix Trie Behind It How the dropdown under a search box is generated from a prefix match, how the candidates are ranked, and why the index must answer partial-query lookups in single-digit milliseconds. information retrieval · intermediate
Apr 21, 2025 Assets as Security Properties Rather Than Components Why an asset inventory keyed by server names produces useless threat lists, how to decompose a system into confidentiality, integrity, and availability assets, and what ownership of each asset implies. security · foundational
Apr 21, 2025 The Reconciliation Loop and Level-Triggered Control of Declared State How a controller compares declared state with observed state, why every event is only a hint to re-read, and what a stale cache costs at the write. virtualization · foundational
Apr 21, 2025 WAL Frames, Read Marks, and What a Checkpoint Can Move How the write-ahead log appends frames instead of rewriting pages in place, how readers pin the log through read marks, and why a checkpoint is bounded by the slowest open reader. mobile computing · foundational
Apr 20, 2025 Autoscaling a Token Service with Cold Starts and Diurnal Load Why reactive scaling fails for inference replicas, how to derive the lead time a scale-out needs, and what a warm pool costs against the peaks it covers. inference systems · advanced
Apr 18, 2025 Catastrophic Cancellation and the Cases Where Subtraction Is Exact Why subtracting two nearly equal numbers amplifies existing error rather than creating it, when the difference is exact by Sterbenz, and how formulas are rewritten to avoid the loss. scientific computing · intermediate
Apr 18, 2025 DNS Failover and the Resolver Caching Bound How record TTLs, negative caching, and resolver behaviour put a floor under DNS-based traffic redirection, and why the observed switchover time exceeds the TTL. cloud infrastructure · foundational
Apr 15, 2025 Failure-Domain Placement: Keeping Replicas Out of the Same Blast Radius How rack, host, and power topology constrain where the third replica goes, why capacity-weighted placement and CRUSH avoid a central allocator, and how correlated loss is measured. distributed systems · advanced
Apr 15, 2025 Merge-Path Partitioning: Splitting Two Sorted Runs Without Sampling How binary search over the merge path cuts two sorted arrays into equal-sized pieces at the correct values, and why the split is exact rather than statistical. algorithms · intermediate
Apr 15, 2025 NUMA Placement and the Cost of Touching Another Socket's Memory How first-touch page placement decides which socket holds a page, what a remote access costs relative to a local one, and why thread pinning without memory placement leaves the cost in place. performance engineering · advanced
Apr 14, 2025 Let-Polymorphism and the Value Restriction Why generalizing every let binding makes mutable references unsound, how the syntactic value restriction blocks the counterexample, and what relaxed variants admit. programming languages · foundational
Apr 14, 2025 Refresh Token Rotation and Replay Detection in OAuth 2.0 How one-time-use refresh tokens turn a stolen credential into a detectable event, what the rotation chain costs in storage, and where concurrent use breaks the model. internet protocols · intermediate
Apr 14, 2025 The Address Spaces a GPU Kernel Can Touch How global, local, shared, and constant memory differ in scope, lifetime, and backing store, and why the compiler must know which space a pointer refers to. gpu computing · foundational
Apr 13, 2025 Debugging Optimised Code: Location Lists and Inlined Frames A variable at -O2 is a rule that changes with the program counter, and an inlined call is a frame that exists only in the debug information. Where both come from. developer tools · advanced
Apr 13, 2025 Splitting Prefill From Decode Inside a Step Prompt processing is compute-bound and token generation is bandwidth-bound; how mixing them in one step costs latency, and how chunked prefill bounds the interference. inference systems · foundational
Apr 12, 2025 Cacheability, Write-Combining, and Mapping Device Memory How page attributes control caching for MMIO and DMA, what happens when a load is speculatively reordered past a device write, and why the mapping must be uncached. memory systems · advanced
Apr 12, 2025 GPIO Configuration Registers and the Reset States That Drive Pins How a general-purpose pin is routed, why the reset state of every pin matters at power-on, and which configuration mistakes produce a pin that looks correct and is not. embedded systems · intermediate
Apr 11, 2025 Ray Differentials for Texture Lookups Along a Ray How a pixel footprint propagates through reflection and refraction, why the propagated footprint can collapse or explode, and what to clamp when it does. computer graphics · advanced
Apr 10, 2025 Steal Time and the Mechanics of CPU Oversubscription How a hypervisor shares physical cores among more vCPUs than it has, how the guest learns it was descheduled, and what the accounting can and cannot reveal. cloud infrastructure · foundational
Apr 10, 2025 The Linux Kernel Memory Model and Its Tooling How LKMM formalises READ_ONCE, smp_mb, and RCU into an executable model, what its relation set adds to the architecture models, and where it deliberately diverges from C11. memory systems · advanced
Apr 10, 2025 Why LRU Eviction Needs a Hash Map and a Linked List The data structure behind least-recently-used eviction, why exact recency ordering costs two pointers per entry, and what CLOCK and frequency-based policies give up to avoid that cost. backend systems · foundational
Apr 9, 2025 Byte Offsets, UTF-16 Code Units, and Editor Positions Why the same cursor sits at several different numbers depending on the encoding counted, how the position encoding for a language server is negotiated, and where the conversions lose alignment. developer tools · foundational
Apr 9, 2025 Cancellation Propagation and the Work That Outlives Its Caller Cancellation is a cooperative signal that reaches only the code that checks it, so a cancelled request can still commit a write; scoping the non-cancellable part is the design work. backend systems · advanced
Apr 9, 2025 Frontier Traversal When the Graph Exceeds Cache: Top-Down Against Bottom-Up Why breadth-first search becomes memory-bound on large graphs, how a bottom-up step inverts the loop over unvisited vertices, and when switching directions pays. algorithms · advanced
Apr 8, 2025 Gradient Checking by Finite Differences The truncation and round-off errors that bound how accurately a numerical derivative can be measured, how to choose the step size and the comparison metric, and why a check can pass on a broken derivative. deep learning · advanced
Apr 8, 2025 Placement as Bin Packing: Multi-Dimensional Fit and the Fragmentation It Creates Why a scheduler with free cores and free memory can still refuse a pod, how multi-dimensional packing produces unusable holes, and which scoring functions trade density against headroom. cloud infrastructure · advanced
Apr 8, 2025 Requantization Inside the Kernel: From Int32 Accumulator to Int8 Output How a convolution kernel turns a 32-bit integer accumulator into the next layer's 8-bit input, why the multiplier is a fixed-point pair, and where saturation and rounding diverge from the reference. inference systems · intermediate
Apr 7, 2025 Bidirectional and Stacked Recurrence: Cost and Causality How a reverse pass and additional layers widen what a recurrent network can see at one position, what each costs in latency and parameters, and when causality forbids the reverse pass. deep learning · intermediate
Apr 7, 2025 Fragmenting Encoded Frames to Fit the Path MTU Why a codec frame larger than a datagram needs RTP-level fragmentation, how the marker bit and timestamp stay shared, and what happens when one fragment is lost. internet protocols · intermediate
Apr 7, 2025 How Live Regions Turn DOM Mutations Into Speech Live regions do not announce anything themselves; they mark a subtree as interesting so that mutations inside it are queued, and politeness, atomicity, and relevance decide what is spoken. accessibility · foundational
Apr 7, 2025 Level-Triggered Reconciliation: Comparing State Instead of Consuming Events Why a controller that reacts to change events loses convergence after a missed event, how periodic full comparison restores it, and what the comparison costs at scale. distributed systems · advanced
Apr 6, 2025 Quad Shading, Helper Invocations, and Where Derivatives Come From Why fragment shaders execute in 2x2 quads, what a derivative instruction computes when neighbouring pixels are not covered, and how helper invocations keep implicit gradients defined. gpu computing · intermediate
Apr 5, 2025 Huffman Coding and the Greedy Merge How repeatedly merging the two lowest-weight nodes builds an optimal prefix code, what the sibling-property exchange shows, and where the code length bound comes from. algorithms · foundational
Apr 5, 2025 Kconfig Options and the Shape of the Compiled Kernel How a configuration symbol turns into preprocessor structure, why IS_ENABLED differs from #ifdef, and how a build-time option silently changes struct layout and the module ABI. operating systems · foundational
Apr 5, 2025 Parallel and Asynchronous SGD: Staleness and Convergence Bounds How splitting a gradient computation across workers changes the update rule, why delayed gradients degrade the guarantee in proportion to the delay, and what communication efficiency costs in accuracy. machine learning · advanced
Apr 5, 2025 Parent-Pointer Forests as the Representation of Disjoint Sets How a partition of n elements is stored as a single array of parent indices, what find and union do to that array, and which questions the representation cannot answer. data structures · foundational
Apr 5, 2025 Prefix Compression and Suffix Truncation in Index Pages How shared key prefixes are stored once per page, why the first key of a page is stored whole, and what restart points cost a search inside a compressed page. databases · advanced
Apr 4, 2025 Alert Fingerprints, Grouping, and Inhibition How an alerting system decides that two firing alerts are the same problem, how grouping batches notifications, and why unstable labels cause page storms. devops · foundational
Apr 4, 2025 Basis Reduction in Practice: LLL, BKZ and the Delta Parameter How the block size K in BKZ sets the security estimate for lattice schemes, why LLL is only the preprocessing step, and what a solver actually does with the reduced basis. cryptography · advanced
Apr 4, 2025 Exact Alarms, Doze, and the Maintenance Window How the platform suspends background work when the device is idle, what an exact alarm buys against that suspension, and why the delivery window widens with time. mobile computing · intermediate
Apr 4, 2025 Queueing Bounds as a Deployment Design Test Using Little's law, utilization curves, and the Kingman approximation to decide whether a proposed deployment can meet a latency scenario before anything is built. software architecture · advanced
Apr 4, 2025 Torn Writes, Sector Atomicity, and the RAID Write Hole Why a 512-byte sector write is atomic but a 4 KiB write may not be, how torn writes corrupt filesystems that assume otherwise, and what parity updates do to crash consistency. memory systems · intermediate
Apr 3, 2025 Interval Tree Clocks and Membership Change How a tree-shaped stamp splits and joins without renumbering every process, why vector clocks break when the participant set changes, and what the fork and join operations cost. distributed systems · intermediate
Apr 3, 2025 Stack Frames and the Lifetime of an Automatic Variable How a function call turns scope into a pointer adjustment, what the frame really holds, and why a local object dies exactly when its block exits. programming languages · foundational
Apr 2, 2025 Ranking Optimization Candidates by Expected Payoff How to combine a measured cost share, a realistic achievable factor, and the probability that a change survives review into one comparable score per candidate. performance engineering · foundational
Apr 2, 2025 Template Contents, Slots, and Declarative Shadow DOM A template owns a document fragment that never enters the page, slots decide which light-DOM children render where, and a shadowrootmode attribute can attach a shadow root during parsing. web platform · advanced
Apr 1, 2025 Phi Functions: Parallel Semantics and the Out-of-SSA Problem Why phi inputs are read simultaneously rather than in sequence, how that forces the lost-copy and swap problems on elimination, and how edge splitting and register coalescing resolve them. compilers · intermediate
Apr 1, 2025 What a File Descriptor Is: An Index Into a Process Table The descriptor is a small integer indexing a per-process array of pointers, and that indirection explains dup, fork, close, and the shared-offset bugs that follow from each. systems programming · foundational
March
Mar 31, 2025 Reading Loss and Round-Trip Time from RTCP Sender and Receiver Reports How the fraction-lost, jitter, and LSR/DLSR fields are computed, why the arithmetic is fixed-point, and where the round-trip estimate breaks down. internet protocols · foundational
Mar 31, 2025 What a Successful Write Guarantees: Durability and Read-After-Write Consistency A 200 response means the bytes survive disk failure, not that every reader sees them yet. How replication, quorums, and listing indexes set the visibility rules. cloud infrastructure · foundational
Mar 30, 2025 Fixed-Point Combinators and How Recursion Enters a Nameless Calculus Why a finite lambda term cannot refer to itself, how the Y and Turing combinators manufacture self-reference through duplication, and what the Z variant fixes about call-by-value. computation theory · intermediate
Mar 29, 2025 Disk-Resident Graph Indexes and the Memory Bandwidth Wall What changes when the vector index no longer fits in RAM: page-oriented adjacency storage, the cost of a random read per hop, and why compression and caching decide throughput. information retrieval · advanced
Mar 29, 2025 Escaping a Chroot Through Retained Directory Descriptors Why changing a process root does not confine a process that holds an open descriptor above it, how the classic escapes work, and what pivot_root and mount namespaces do differently. virtualization · advanced
Mar 28, 2025 KTX2 Containers and What Basis Transcoding Actually Saves How a KTX2 file stores mip levels, faces, and layers in one level index, and why a supercompressed texture can be transcoded to several GPU formats without re-encoding. computer graphics · advanced
Mar 28, 2025 Rollback Without Downgrade: Containment After a Bad Release Ships Why the installer cannot un-ship a build, how remote configuration and feature gating contain a defect, and which failures those mechanisms cannot reach at all. mobile computing · advanced

2025

March