Skip to main content

Loading page…

Lock-Free & Wait-Free Programming: Performance & Optimization | LowLevelCraft

Tracks
Performance & Optimization
Lock-Free & Wait-Free Programming

Subtrack

Sign in to track progress

Lock-Free & Wait-Free Programming

Concurrency without locks. Learn atomic operations, memory ordering, lock-free data structures, and wait-free algorithms.

~360 Minutes 8 Challenges

lock free queue tutorial C

About this subtrack

Lock-Free Programming introduces atomics, ABA, and queues carefully. Not a first concurrency lesson.

Tasks (8)

Understand C11 Memory Ordering: relaxed, acquire, release, seq_cst

Implement Lock-Free Stack Using Compare-And-Swap

Fix ABA Problem Using Stamped Reference or Hazard Pointers

Implement Lock-Free Queue (Michael-Scott Queue)

Implement SPSC Lock-Free Queue (Single Producer Single Consumer)

Benchmark Lock-Free vs Mutex-Based Queue Under High Contention

Implement Epoch-Based Memory Reclamation for Lock-Free Data Structures

Implement a Wait-Free Counter