Lock Free Queue Based On Hazard Pointer.
-
Updated
Feb 27, 2020 - C++
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
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.
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
Add a description, image, and links to the hazard-pointers topic page so that developers can more easily learn about it.
To associate your repository with the hazard-pointers topic, visit your repo's landing page and select "manage topics."