Complete archive
Archive
3,240 articles, newest first · page 3 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
Sep 22, 2026 Mapping Sampled Addresses Back to Functions and Source Lines A sample records a virtual address; turning it into a function name, a file, and a line number requires load addresses, symbol tables, and debug information that frequently disagree. performance engineering · foundational - Sep 22, 2026 Multipart Upload: Choosing a Part Size That Survives a Retry Parts are immutable commit units. The 5 MiB floor, 10,000-part ceiling, and per-part checksums turn part size into a decision about retry cost and memory. cloud infrastructure · intermediate
- Sep 22, 2026 Quicksort Partition Schemes and the Duplicate-Key Quadratic How Lomuto and Hoare partitioning differ in swap count and branch behaviour, why two-way partitions degrade on equal keys, and what three-way partitioning restores. algorithms · intermediate
- Sep 22, 2026 Thermal Design Power and the Throttling It Authorises What a TDP rating specifies, why a part may exceed it briefly, how the control loop reacts to temperature and current limits, and why two parts with the same TDP perform differently. computer architecture · intermediate
- Sep 21, 2026 Half-Edge Adjacency and Constant-Time Mesh Traversal How splitting each edge into two directed halves makes neighbour queries pointer dereferences, what the structure costs in bytes, and where it refuses to apply. computer graphics · foundational
- Sep 21, 2026 Scopes Are Strings, Consent Is Policy: Where Access Limits Actually Live Why the scope parameter is only a request, how authorization servers narrow or refuse it, and what incremental authorization costs in state tracking. internet protocols · intermediate
- Sep 21, 2026 Seasonal Baselines and the False Alerts They Prevent A fixed threshold on a metric that varies by weekday produces a stream of alerts that gets ignored; a baseline has to model the periodicity it is compared against. data engineering · intermediate
- Sep 21, 2026 Sharding Session Data and the Size Ceiling How session keys are partitioned across nodes as the store grows, why resharding is safer at a partition layer, and what a large cookie costs on every request. backend systems · advanced
- Sep 20, 2026 Acquire and Release as One-Way Ordering Constraints How a release store and an acquire load each constrain ordering in only one direction, and why the pair is enough to publish data without a full fence. computer architecture · intermediate
- Sep 20, 2026 Adapter Residency When One Replica Serves Many Fine-Tunes Low-rank adapters let dozens of fine-tunes share a base model, but each token still needs one adapter applied. Residency, batch grouping, and routing decide whether that sharing pays. inference systems · advanced
- Sep 20, 2026 Aggregate Boundaries and Transaction Scope How to decide what loads and changes together in one transaction, why object references across those boundaries cause trouble, and how conflicts are detected. software architecture · intermediate
- Sep 20, 2026 RPC Interface Definitions and Wire Framing How an interface definition becomes bytes on a connection, from protobuf field encoding to gRPC length-prefixed messages and JSON-RPC envelopes. backend systems · foundational
- Sep 20, 2026 Storage Partition Keys and the Origin Boundary How a browser derives the key that web storage is filed under, how scheme and port enter that key, and why partitioned third-party storage adds the top-level site. web platform · foundational
- Sep 19, 2026 Authorization Code Flow: Why the Redirect Carries a Code and Not a Token How the front channel and back channel split the grant, what exact-match redirect URI registration protects, and where state and mix-up defences sit in the exchange. internet protocols · foundational
- Sep 19, 2026 Cache Miss Handling and Patching Code at the Access Site What happens on the first execution of a property access, how the runtime rewrites the site without breaking other threads, and why the patched instruction must be safe to overwrite atomically. language runtimes · advanced
- Sep 19, 2026 Inverted Index Construction and Query Planning for Log Search How tokenized log records become delta-encoded posting lists, how a time-partitioned index prunes work, and when a scan beats an index lookup. observability · intermediate
- Sep 18, 2026 Multipath TCP and the Data-Level Sequence Space How MPTCP separates a 64-bit connection-level byte counter from the 32-bit per-subflow counters, why the mapping needs a signal option, and what reordering costs. networking · advanced
- Sep 18, 2026 Multisampling: Coverage Samples Without Shading Every Sample MSAA asks the coverage question at several positions per pixel but shades only one, and the gap between the two is where its bandwidth advantage and its characteristic failures live. computer graphics · intermediate
- Sep 18, 2026 QPACK and the Cost of a Shared Header Table Why HTTP/3 could not reuse HPACK unchanged, how absolute and relative indices decouple encoding from delivery order, and what a blocked stream actually waits for. internet protocols · advanced
- Sep 18, 2026 Surface Area Heuristic and the Cost Model Behind BVH Splits Why the SAH estimates traversal work with surface area, how the sweep builds the candidate list in linear time, and when object splitting beats spatial splitting. computer graphics · intermediate
- Sep 17, 2026 Label Matchers, Posting Lists, and How a Series Is Selected How the inverted index maps label pairs to series, why equality matchers intersect cheaply while regex matchers degrade to scans, and what the index cannot answer. observability · advanced
- Sep 17, 2026 Latency Targets and the Capacity Floor They Imply Why queueing delay grows without bound as utilization approaches one, how a p99 objective translates into a utilization ceiling, and what that ceiling costs per month. cloud infrastructure · advanced
- Sep 17, 2026 Radiance, Irradiance, and the Units a BRDF Is Written In How solid angle separates radiance from irradiance, why a BRDF is a ratio of two different radiometric quantities, and what the resulting numbers look like for ordinary surfaces. computer graphics · foundational
- Sep 17, 2026 Unbiased Random Integers from a Finite Random Source How taking a remainder from a random word introduces measurable bias, and how rejection sampling and multiply-and-reject produce exact uniformity at a bounded cost. algorithms · foundational
- Sep 16, 2026 Active Queue Management and Latency Under Load How tail-drop buffers convert delay into loss, what controlled-delay algorithms change about the signal a sender receives, and why their tuning constants are what they are. networking · advanced
- Sep 16, 2026 Checkpointing and the Cost of a Consistent Snapshot Why capturing a consistent image of a mutating data structure requires either a pause or a write barrier, and how copy-on-write roots, double buffering, and fuzzy checkpoints differ in cost. memory systems · intermediate
- Sep 16, 2026 Erase Blocks, Pages, and the Asymmetry That Shapes Flash Storage Why NAND programs a page once and erases a whole block, and how that mismatch forces every layer above the device to maintain a mapping and a collector. filesystems · foundational
- Sep 16, 2026 Kernel Density Estimation and the Bandwidth Trade-off Placing a kernel on every observation gives a density estimate with one smoothing parameter, and the rate at which that parameter must shrink with sample size explains why the method becomes almost unusable in high dimensions. machine learning · advanced
- Sep 16, 2026 Multibit Tries and Longest-Prefix Matching for Address Lookups Walking one bit per level is too slow for router tables. Stride compression, prefix expansion, and stored prefix lengths trade table size against lookup depth under a fixed memory budget. data structures · intermediate
- Sep 16, 2026 Posted Writes and the Ordering Rules a Device Must Respect Why PCIe memory writes are fire-and-forget, which transactions may pass which, and how a device orders its data ahead of its interrupt so the handler sees a completed transfer. hardware engineering · intermediate
- Sep 16, 2026 Target Triples, Sysroots, and What Actually Changes When Cross-Compiling A triple names an architecture, vendor, operating system, and ABI. The hard part of cross-compilation is not instruction selection but the header tree, startup objects, and libraries that the triple implies. compilers · foundational
- Sep 15, 2026 Comparing Two Profiles to Find a Regression That Is Real A differential flame graph is a difference of two sample sets on a shared layout; the normalisation, the noise floor, and frame identity each decide whether a red bar means anything. performance engineering · advanced
- Sep 15, 2026 InfoNCE and the Temperature Parameter How the contrastive objective turns similarity scores into a softmax over the batch, why the temperature controls effective negative count and gradient shape, and what breaks when it is set wrong. deep learning · foundational
- Sep 15, 2026 Load Shedding and Retry Amplification How a collector decides what to discard when it cannot keep up, why synchronized retries sustain an outage, and how priority classes keep the useful signal alive. observability · advanced
- Sep 14, 2026 Capability Machines and the CHERI Bounds Encoding How a pointer that carries its own bounds and permissions replaces a flat address space, what the compressed bounds cost in bits, and why the model makes spatial safety a hardware property. memory systems · advanced
- Sep 14, 2026 Choosing a Mip Level from Screen-Space Derivatives How four partial derivatives become one level-of-detail value, why the maximum of the axes beats the average, and where trilinear blending and LOD bias change the answer. computer graphics · intermediate
- Sep 14, 2026 Instruction Scheduling and Its Dependence on the Graph How list scheduling trades register pressure against parallelism, what latency and resource tables must contain, and why the scheduler sees a different graph from the one the optimiser built. compilers · intermediate
- Sep 14, 2026 Monotone Decision Points: Divide-and-Conquer Optimization in DP When the argmin of a one-dimensional recurrence is monotone in the state, the transition scan collapses from a factor of n to a logarithm, and the Monge condition is what licenses it. algorithms · advanced
- Sep 14, 2026 Zone Transfers and Secondary Replication: AXFR, IXFR, and the SOA Timers How a secondary server detects that a zone changed, what a full transfer costs against an incremental one, and how serial number arithmetic makes wrap-around safe. internet protocols · advanced
- Sep 13, 2026 Calling Conventions on an Operand Stack How arguments, return values, receivers, and frame transitions are encoded in a stack machine, and why the receiver occupies slot zero of a method frame. language runtimes · intermediate
- Sep 13, 2026 Mip Chain Construction by Box Reduction What averaging four texels into one actually preserves, where the filter sits against the ideal low-pass, and why sRGB, normal maps, and odd dimensions each need different treatment. computer graphics · foundational
- Sep 12, 2026 From Joint Hierarchy to Skinning Palette How parent-relative joint transforms compose into world matrices, why the bind pose is stored as an inverse, and what a skeleton costs to upload every frame. computer graphics · foundational
- Sep 11, 2026 Lock-Free Linked Lists and the Reclamation Problem Compare-and-swap can insert and delete on a singly linked list without locks, but freeing a removed node requires hazard pointers or epoch tracking to stop reuse. data structures · advanced
- Sep 11, 2026 MAC Learning and How a Bridge Builds Its Forwarding Table A transparent bridge learns source addresses, forwards unknown destinations out every port, and ages entries out; the failure modes of each step. networking · intermediate
- Sep 11, 2026 Password-Based Key Derivation and What Iteration Counts Buy How salts, memory hardness, and iteration counts change the cost of guessing a password-derived key, and where each parameter stops helping. cryptography · foundational
- Sep 11, 2026 Pooling Depth and the Unjudged Tail How pooled judgments are built from system submissions, why bias grows with pool depth and novelty, and how to measure the reliability of a partial pool. information retrieval · intermediate
- Sep 11, 2026 Post-Copy Migration and Demand Paging from the Source Instead of shrinking the dirty set, post-copy moves the vCPUs first and faults memory back from the source on demand. It bounds downtime at the cost of fault latency and a source that cannot be released. virtualization · advanced
- Sep 11, 2026 Reference Counting and Its Structural Blindness to Cycles Why a count per object frees memory deterministically and still leaks a two-node cycle, what the counting discipline costs per assignment, and how trial deletion recovers. language runtimes · foundational
- Sep 11, 2026 Slice Bounds Checks and the Conditions for Eliding Them How a length-carrying descriptor makes every index a checked operation, what the branch costs when it is not removable, and which static facts let a compiler prove it away. memory systems · intermediate
- Sep 11, 2026 Why Zero Violations Is Not a Pass Automated checks cover a minority of success criteria, report a large incomplete queue, and cannot observe interaction, so a clean run bounds failure rather than proving conformance. accessibility · intermediate
- Sep 10, 2026 Algebraic Effects and Effect Rows in the Type System How a computation type records what it may do, how handlers discharge rows, and why effect polymorphism needs its own quantification. programming languages · advanced
- Sep 10, 2026 CORS Preflight, Credentials, and the Response Sharing Rules The request classifications that decide whether a preflight happens, what the OPTIONS exchange negotiates, and why credentialed CORS forbids the wildcard origin. web platform · foundational
- Sep 10, 2026 From execve to _start: How the Kernel Maps an ELF Executable Program headers rather than section headers drive loading, PT_LOAD segments carry permissions, PT_INTERP names the dynamic linker, and the kernel hands over a stack with argc, argv, and auxv. compilers · intermediate
- Sep 10, 2026 Issue Width and Its Diminishing Returns Why widening an out-of-order issue window costs area and energy faster than it buys performance, and where the wakeup, select, and bypass networks set the ceiling. computer architecture · intermediate
- Sep 10, 2026 Searcher Snapshots and Lock-Free Concurrent Readers How a search engine publishes a new index version to running queries without pausing them, using copy-on-write searcher snapshots and reference counting. information retrieval · advanced
- Sep 10, 2026 Why a Held-Out Test Set Cannot Be Reused What a test-set score actually estimates, how a second look at the same rows biases it upward, and the leakage paths that corrupt the number before any model is fitted. machine learning · foundational
- Sep 9, 2026 Fibonacci Heaps and the Amortised Case for Decrease-Key How deferred consolidation makes meld and decrease-key constant amortised, what the potential function measures, and why the theoretical win rarely survives contact with memory. data structures · advanced
- Sep 9, 2026 How a Microcontroller Memory Map Assigns Meaning to Every Address How fixed address regions are decoded on a microcontroller, why peripherals sit at constant addresses, and what the bus does with an address that nothing claims. embedded systems · foundational
- Sep 9, 2026 Scheduling Before Allocation and the Pressure Trade Why an aggressive instruction schedule can force spills that erase its own benefit, how pressure-aware scheduling caps live values, and what iterative repair actually converges on. compilers · advanced
- Sep 9, 2026 The Role Attribute as a Contract With the Accessibility Tree How a role token rewrites what the accessibility tree exposes, why it adds no behaviour, and how the first valid token in a list wins. accessibility · foundational