HFT CORE SYSTEMS

Michael–Scott queue and linked-node trade-offs

Lesson 63 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. Locate enqueue and dequeue linearization points
  2. Understand helping in a lock-free algorithm
  3. Account for allocation and reclamation cost

Lab

Hands-on exercise

Trace a Michael–Scott queue through contending operations.

Deliverable

Evidence of completion

An annotated algorithm walk-through with reclamation requirements.

Prerequisite
EP 62

Phase 06

Concurrency and lock-free engineering

Full curriculum