YoVDO

Designing Wait-free Weak Reference Counting

Offered By: ACM SIGPLAN via YouTube

Tags

Memory Management Courses Concurrent Programming Courses Parallel Computing Courses Garbage Collection Courses Lock-free Programming Courses Atomics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

[O'HearnFest] Designing Wait-free Weak Reference Counting


Taught by

ACM SIGPLAN

Related Courses

Java Programming: Step by Step from A to Z
Udemy Java Application Performance Tuning and Memory Management
Udemy ASP.NET Core New Features
LinkedIn Learning First Look: Java 10 and Java 11
LinkedIn Learning Java Essential Training: Syntax and Structure
LinkedIn Learning