Concurrent Immediate Reference Counting
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a groundbreaking approach to memory management for optimistic concurrency in unmanaged programming languages in this 17-minute video presentation from PLDI 2024. Delve into Concurrent Immediate Reference Counting (CIRC), a novel combination of Safe Memory Reclamation (SMR) algorithms with reference counting. Learn how CIRC addresses challenges in automatic memory management for highly concurrent data structures, offering immediate reclamation of linked structures and efficient decrement application. Discover how this method compares to existing techniques like Fast Reference Counter, OrcGC, and Concurrent Deferred Reference Counting in terms of performance and memory usage. Gain insights into CIRC's potential as a solution for safe automatic memory management in unmanaged languages, supported by experimental results and comprehensive analysis.
Syllabus
[PLDI24] Concurrent Immediate Reference Counting
Taught by
ACM SIGPLAN
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera