Tag
optimistic-concurrency
- Sep 23, 2026 Atomic Commits and Snapshot Isolation Between Concurrent Writers What makes a commit atomic when the storage offers only single-object writes, how two writers racing on the same table are serialized, and which conflicts are detected only at commit time. data engineering
- 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
- Jul 10, 2026 Concurrent Mutations and Versioned Session Records Why whole-record writes lose updates when a browser issues requests in parallel, and how compare-and-set, fencing tokens, and delta operations keep the record coherent. backend systems
- Mar 14, 2026 Seqlocks: Optimistic Reading Without Blocking the Writer How a version counter lets readers copy shared data without registering, why the writer never waits, and which data types make the retry loop impossible to get right. operating systems
- Jan 23, 2025 Optimistic Concurrency and the Conflict Check That Arrives Too Late How version-token conflict detection works in a replicated store, why it cannot prevent a conflicting write, and what the abandoned Bayou and Coda designs revealed about the cost of checking after the fact. computing history
- Dec 3, 2024 Software Transactional Memory: Logs, Validation, and Retry How a transaction records its reads and writes in a log, why validation must happen before commit, and what livelock looks like when two long transactions keep colliding. programming languages
- Feb 27, 2024 Compare-and-Swap Retry Loops and the ABA Problem on a Versioned Register Why an optimistic update loop can silently apply a stale decision, how version numbers close the window, and what the loop costs when contention is high. distributed systems
- Apr 1, 2023 Event Sourcing and the Append-Only Log as System of Record Storing the sequence of facts instead of the current state changes what a write has to prove, how a snapshot is defined, and why an event schema cannot be changed once it has been written. software architecture