Wait-Free Weak Reference Counting - ISMM 2023

Explore a groundbreaking approach to memory management in this 16-minute video presentation from ISMM 2023. Delve into the challenges of reference counting, particularly addressing cyclic references that hinder object deallocation. Learn about a novel wait-free algorithm for weak reference counting that improves upon classic implementations. Discover how this algorithm utilizes primitive wait-free atomic operations and offers significant performance improvements in high-contention scenarios. Examine the correctness proof, C++ implementation, and micro-benchmark results demonstrating the algorithm's effectiveness. Gain insights into a second algorithm that combines the strengths of different approaches, offering improved worst-case performance while maintaining impressive speedups in optimal conditions. Ideal for developers and researchers interested in advanced memory management techniques and concurrent data structures.

[ISMM'23] Wait-Free Weak Reference Counting