hazard-pointers

Lock Free Queue Based On Hazard Pointer.

A sane and minimal implementation of hazard pointers in pure C89.

Lock-less Linked List, garbage collection (gc) in parallel computing

Unbounded lock-free MPMC queue for C++11 — Michael-Scott algorithm with hazard-pointer reclamation, pluggable allocators, and single-CAS batch dequeue.

Solutions to KAIST CS431 Concurrent Programming — lock-based and lock-free data structures, hazard pointers, and a concurrent hash map in Rust, passing the official stress tests

different variants of concurrent queue

Set of utils and helpers to write apps in Rust.

High-performance lock-free stacks in C++ implementing various memory management strategies: Hazard Pointers, Split Reference Counting, and C++20 Atomic Shared Pointers. Includes detailed performance benchmarks.

Header-only lock-free concurrent containers for C++11: fully lock-free unordered_map/unordered_set (split-ordered list) and concurrent map/set (red-black tree). Epoch or hazard-pointer reclamation, std-compatible API, zero dependencies beyond the standard library.

A Michael–Scott lock-free queue in C++ with safe memory reclamation, verification, and a rigorous benchmark harness.