Concurrency TS2: Improved C++ Concurrency and Lock-free Programming

on YouTube ↗01h 04m

" summary

Concurrency TS2 claims standardized low‑level tools: Hazard Pointers and RCU for safe reclamation with retire semantics (hazard protection ~4 ns, RCU reader construction ~3 ns in hot cache) and bounded unreclaimed objects, Bytewise Atomic Memcpy to enable efficient sequence‑lock style reads, and an Asymmetric Fence that makes the common reader path ~2 ns vs ~32 ns for a full atomic fence on Haswell. The paper is sent as a PDTS toward ISO and some pieces are already moving into C++26; reclamation can be deferred or offloaded to a background thread.

AI-written summary · about

" chapters (9)

1. 0:00Introduction
2. 6:43Hazard pointers and RCU
3. 25:59RCU API details
4. 31:27Hazard pointer API
5. 39:17Asymmetric fences
6. 45:41Bitwise atomics
7. 50:01Synchronized values
8. 54:12C++26 integration
9. 56:04Q&A

" related talks

• 01h 08mA lock-free concurrent toolkit for hazard pointersMichael S Wong · Meeting C++ 2016
• 59mThreads and Locks must GoRainer Grimm · Meeting C++ 2017
• 01h 02mA Lock-Free Atomic Shared Pointer in Modern CppTimur Doumler · CppCon 2022
• 01h 04m[old version]The C++20 Synchrononization LibraryBryce Adelstein Lelbach · Meeting C++ 2019
• 52mBest Practices for ConcurrencyRainer Grimm · Meeting C++ 2018
• 01h 04mThe C++20 Synchronization LibraryBryce Adelstein Lelbach · Meeting C++ 2019
• 01h 00mLock-Free Programming (or, Juggling Razor Blades), Part IHerb Sutter · CppCon 2014
• 01h 01mThe Future of C++ Parallel and Concurrency Safety GuidelinesMichael S Wong, Ilya Burylov · CppCon 2020