Tag
reference-counting
- 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
- 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 6, 2026 Reference Counting and the Cycle It Cannot Break How an atomic count turns ownership into a distributed protocol, why strong counts cannot reclaim a cycle, and what weak references and trial deletion cost to add. programming languages
- Jul 24, 2026 Atomic Reference Counts and the Cycle They Cannot Collect The instruction cost of shared ownership, why the count must be atomic, and the reachability problem that makes a pure reference-counting collector leak. systems programming
- Nov 13, 2025 Wake Locks, Reference Counting, and the Cost of a Held CPU Why a wake lock is a counted system resource rather than a flag, what a partial lock actually keeps powered, and how an unbalanced acquire turns into a battery complaint. mobile computing
- Jan 10, 2024 Snapshot Expiry, Reference Counting, and Files That Nothing Points To Why deleting an old snapshot does not delete its files, how a sweeper decides which objects are unreferenced, and the two ways that decision goes wrong in opposite directions. data engineering