DiscoverCode ImpactHyaline: Fast and Transparent Lock-Free Memory Reclamation
Hyaline: Fast and Transparent Lock-Free Memory Reclamation

Hyaline: Fast and Transparent Lock-Free Memory Reclamation

Update: 2025-01-25
Share

Description

This research paper introduces Hyaline, a novel family of memory reclamation schemes for lock-free data structures in unmanaged C/C++ code. Hyaline leverages reference counting, but only during reclamation, minimising overhead during object access and balancing workload across threads. The paper details Hyaline's design, including a scalable multi-list version and robust extensions to handle stalled threads. Extensive testing across multiple architectures demonstrates Hyaline's superior performance and memory efficiency compared to existing schemes like epoch-based reclamation and hazard pointers, particularly in read-dominated and oversubscribed scenarios. The paper concludes by proving Hyaline's correctness and lock-freedom properties.

Comments 
loading
00:00
00:00
1.0x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

Hyaline: Fast and Transparent Lock-Free Memory Reclamation

Hyaline: Fast and Transparent Lock-Free Memory Reclamation

Sanket Makhija