cppvalleyC++ · Systems · Low Latency · HFT
HFT Core Systems

HFT CORE SYSTEMS

Hazard pointers and safe reclamation

Lesson 66 of 96Phase 06: Concurrency and lock-free engineering
Video lesson coming soon

The written objectives and hands-on lab are available now.

cppvalley on YouTube ↗

Learning objectives

What you should understand

  1. Publish protected pointers before dereference
  2. Retire and scan nodes safely
  3. Account for thread registration and scan overhead

Lab

Hands-on exercise

Add hazard-pointer reclamation to a linked structure.

Deliverable

Evidence of completion

A safety argument with reclamation stress tests and overhead data.

Prerequisite
EP 65

Phase 06

Concurrency and lock-free engineering

Full curriculum
57The C++ memory model and data-race freedom58Sequential consistency and total order59Acquire/release publication60Relaxed atomics, counters, and misconceptions61SPSC ring buffer from invariants first62Bounded MPMC queues and sequence numbers63Michael–Scott queue and linked-node trade-offs64Spinlocks, atomic_wait, futexes, and backoff65ABA: mechanism, not slogan66Hazard pointers and safe reclamation67Epoch reclamation and user-space RCU68Phase gate: queue library and concurrency defense