Notes / Patterns / 13 Concurrency Patterns / 02 Lock Free Programming

02 — Lock-Free Programming

Compare-and-Swap, Atomic Variables, and Wait-Free vs. Lock-Free Queues — trading locks for retry loops to avoid blocking, priority inversion, and deadlock.

Chapter Navigation
On This Page

02 — Lock-Free Programming

Purpose

[stub: lock-free-programming]

Metadata

AuthorAmit Singh
Scopepatterns

Local graph

Full graph →