Skip to content
Tagged articles

pessimistic locking

5 articles · Page 1 of 1
Yumin Fish Harvest
Yumin Fish Harvest
Oct 2, 2026 · Backend Development

Concurrent Write Correctness: Choosing Between Conditional Updates, Pessimistic/Optimistic Locks, and Distributed Locks

This article analyzes four concurrency control patterns — conditional updates, pessimistic locking, optimistic locking with version numbers, and distributed locks — using inventory deduction, order editing, and third-party push examples. It explains when each pattern applies, how to combine them with idempotency, and provides concrete SQL and Redis implementations.

Distributed LocksIdempotencyOptimistic Locking
0 likes · 32 min read
Concurrent Write Correctness: Choosing Between Conditional Updates, Pessimistic/Optimistic Locks, and Distributed Locks
Architect's Alchemy Furnace
Architect's Alchemy Furnace
Aug 8, 2020 · Fundamentals

Mastering Locks: From Pessimistic to Distributed Concurrency Control

This article explains why locks are essential in programming, categorizes various lock types such as pessimistic, optimistic, spin, fair, reentrant, and distributed locks, and shows how to choose and implement them in Java for high‑concurrency, high‑availability, and high‑performance systems.

JavaOptimistic Lockingdistributed-systems
0 likes · 12 min read
Mastering Locks: From Pessimistic to Distributed Concurrency Control
ITPUB
ITPUB
May 22, 2016 · Databases

Why Optimistic Locking Improves High‑Concurrency Performance

Optimistic locking replaces heavyweight pessimistic locks with a version‑based approach, allowing concurrent reads and only checking a version or timestamp during updates, which reduces lock contention, improves performance under high concurrency, but requires careful handling of external updates to avoid dirty data.

Database PerformanceOptimistic Lockingconcurrency control
0 likes · 5 min read
Why Optimistic Locking Improves High‑Concurrency Performance