The Upcoming Concurrency TS Version 2 for Low-Latency and Lockless Synchronization
summary
ISO C++ formally approves Concurrency TS v2 with concrete, testable interfaces: hazard pointers (domains, protect/try_protect, retire) and RCU RAII readers plus intrusive/non‑intrusive retire semantics. Folly and Linux kernel implementations exercise array optimizations, cohort synchronous reclamation, dedicated reclamation thread pools and integrated link counting; repos and a reference implementation sit on GitHub. Scans reveal heavy costs when reclaiming tens of thousands of objects (20k+ hazard pointers, 40k retired items), so a pared C++26 subset targets async reclamation first.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 0:26Overview of speakers
- 1:14Agenda
- 2:08History of concurrency TS1
- 3:43The long path to standardization
- 6:10Role of technical specifications
- 9:46Concurrency TS2 content
- 11:34Hazard pointers interface
- 14:48Hazard pointers usage
- 18:50Lessons from implementation
- 23:03Proposals for C++26
- 28:24Latency and technical discussion
- 30:35Introduction to RCU
- 34:48RCU API design
- 37:13RAII for RCU readers
- 41:50RCU and locking
- 45:26RCU challenges and Q&A
- 47:21Conclusion
related talks
01h 01mBack to Basics: C++ Concurrency
01h 01mSmarter Cpp Atomic Smart Pointers - Efficient Concurrent Memory Management
01h 02mModern C++ Safety and Security At 20
01h 02mLock-free programming for real-time systems
01h 02mTowards Correctness, Safety and Security in C++26
48mSecure C++ Programming
58mC++11 Multithreading done right?
45mThe existential threat against C++ and where to go from here