A C++ library of Concurrent Data Structures
-
Updated
Oct 17, 2023 - C++
A C++ library of Concurrent Data Structures
A C++ library providing various concurrent data structures and reclamation schemes.
Effective Memory Reclamation
Hazard pointer based concurrent memory reclamation for Rust.
A simple hazard pointer implementation for your memory well being
concurrent and lockfree data structures in C++
Verification tool for lock-free data structures with safe memory reclamation.
A sane and minimal implementation of hazard pointers in pure C89.
A complete hazard pointer library written in C++17.
Hazard Pointer implemented in C++ with RAII style.
C Lockless Data Structures
Non-blocking, lock-free queues in C with multiple readers and writers. Includes SimpleQueue, RingsQueue, LLQueue, BLQueue, and Hazard Pointer for safe memory management.
Concurrent programming project.
C programming offers robust features including pointers, dynamic memory allocation, and an extensive library. This repository focuses on essential data structures like stacks (LIFO), queues (FIFO), linked lists (singly, doubly, circular), and collision handling techniques in hashing (chaining, open addressing).
Add a description, image, and links to the hazard-pointer topic page so that developers can more easily learn about it.
To associate your repository with the hazard-pointer topic, visit your repo's landing page and select "manage topics."