Erez Petrank — Memory management for concurrent data structures (Part 1)

Ближайшая конференция — Joker 2024, 9 октября (Online), 15–16 октября (Санкт-Петербург + трансляция).
— —
. . . . In part 1 of this class, we will start with a crash course on garbage collection, including the basic classical algorithms. We will then focus our attention on concurrent garbage collection, which is intended to provide the running programs with better progress guarantees. Finally, we will explain why lock-freedom is foiled when using any memory manager known to us today. Lock-free garbage collection is an open problem.

In part 2 of the class, we will discuss specific memory managers that are meant to provide support for lock-free data structures without foiling their lock-free guarantees. We will start with the simple algorithms of the 90's and then survey recently published algorithms. We will go over properties that these algorithms must satisfy, explain the difficulties, and explain what the state-of-the-art memory managers provide.