Work

Brief Announcement: SCOT: Fix non-blocking data structures, not memory reclamation

Year: 2025

Type: conference-paper

Abstract: We present Safe Concurrent Optimistic Traversals (SCOT), to address a well-known problem related to optimistic traversals with both classical and more recent memory reclamation schemes, such as Hazard Pointers (HP), Hazard Eras (HE), Interval-Based Reclamation (IBR), and Hyaline. For these schemes, unlike for Epoch-Based Reclamation (EBR), existing data structure implementations are either buggy (e.g., Natarajan-Mittal tree) or come with performance trade-offs (e.g., Harris-Michael modified list).

Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

DOI: 10.1145/3694906.3743348

Authors: Md Amit Hasan Arovi, Ruslan Nikolaev

Institution: Pennsylvania State University

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W4412482048

FWCI: 2.571

Cites: 14

Cited by: 2

Related to: 10