Explore a 19-minute conference talk on designing wait-free weak reference counting, presented by Matthew J. Parkinson at ACM SIGPLAN's O'HearnFest. Delve into advanced memory management techniques and learn about innovative approaches to implementing efficient and scalable reference counting systems in concurrent programming environments.
Overview
Syllabus
[O'HearnFest] Designing Wait-free Weak Reference Counting
Taught by
ACM SIGPLAN
Related Courses
-
Wait-Free Weak Reference Counting - ISMM 2023
-
Introduction to Lock/Wait Free Algorithms - Defining and Understanding the Terms
-
Concurrent Immediate Reference Counting
-
A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation - PLDI 2024
-
Reference Counting Deeply Immutable Data Structures with Cycles
-
Lock-free Atomic Shared Pointers Without a Split Reference Count - Implementation Strategies
