Tag
copy-on-write
- 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
- 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
- Aug 14, 2026 Delete Files and the Cost of Merge-on-Read How a row-level delete is expressed without rewriting a data file, what a reader must do to apply it, and why position-based deletes are cheaper than equality-based ones. data engineering
- Jun 26, 2026 Copy-on-Write and Block Shadowing Instead of a Log How never modifying a reachable block replaces journal replay with a root pointer swap, and what the tree-copying cost buys in atomicity. filesystems
- Jun 21, 2026 Concurrent Readers on a Mutating Trie Lookups traverse many dependent loads, so per-node locking is untenable. How publish-then-swap, deferred reclamation, and path copying keep readers safe while nodes grow and split. data structures
- Mar 21, 2026 Shadow Paging and Copy-on-Write Trees How writing a modified page to a new location instead of in place makes every update atomic, what the pointer-update protocol must flush, and how the space cost accumulates until a collection pass reclaims it. memory systems
- Feb 23, 2026 Copy-Up, Whiteouts and Rename in Overlay Roots What happens on the first write to a file from a lower layer, how deletions are represented without deleting, and which POSIX behaviours overlayfs cannot preserve. virtualization
- 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
- Jul 16, 2025 Path Copying in a Copy-on-Write B-Tree How a single key update rewrites the nodes along one root-to-leaf path, why sibling splitting propagates upward, and what the node layout must guarantee. filesystems
- Feb 19, 2024 What fork Copies, and Why Copy-on-Write Defers Almost All of It How the kernel duplicates an address space by sharing page frames read-only, what a write does to break the sharing, and why fork without exec is expensive. operating systems
- Nov 25, 2023 Why fork and exec Are Separate Calls The two-step process creation model, what fork copies and what copy-on-write defers, and why the split survives despite its cost in a program that only wants to exec. computing history