High-performance wait-free memory reclamation for wait-free data structures (ASMR). Bounded memory usage, predictable latency.
-
Updated
Oct 27, 2026 - Rust
#
memory-reclamation
Here are 11 public repositories matching this topic...
A library that design with usability, reusability, scalability to reclaim memory safely in multithreading scenario.
scalability concurrency efficiency data-structures usability cpp17 memory-management lock-free reusability memory-reclamation epoch-based
-
Updated
May 25, 2022 - C++
Verification tool for lock-free data structures with safe memory reclamation.
verification data-structures memory-management lock-free type-system hazard-pointer staticanalysis linearizability epoch-based-reclamation memory-reclamation
-
Updated
Jun 18, 2021 - C++
This repository provides an extremely lightweight implementation of Quiescent-State-Based Reclamation (QSBR). It is designed for async engines, allowing them to implement lock-free data structures without expensive garbage collection.
-
Updated
Dec 12, 2025 - Rust
Benchmark-driven low-level C++ building blocks: lock-free queues with hazard-pointer reclamation, a compile-time type-checked flow DSL (zero-overhead vs hand-written at the right fusion depth), noexcept-contract awaitables, pooled allocators. Header-only.
cpp async cpp14 concurrency template-metaprogramming header-only low-latency lock-free hazard-pointer systems-programming zero-overhead zero-cost-abstraction lock-free-queue memory-reclamation task-system flow-dsl pooling-allocator
-
Updated
Sep 5, 2026 - C++
A lock-free concurrent skip list in Rust with hand-rolled epoch-based memory reclamation. Zero dependencies.
-
Updated
Jun 12, 2026 - Rust
Interactive Emacs Lisp lab exposing ABA corruption hidden behind successful compare-and-swap operations.
emacs-lisp concurrency telemetry lock-free observability aba-problem memory-reclamation interactive-lab
-
Updated
Jul 29, 2026 - Emacs Lisp
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.
performance-engineering cpp high-performance concurrency multithreading data-structures lock-free google-benchmark aba-problem cpp20 memory-reclamation hazard-pointers
-
Updated
Mar 29, 2026 - C++
Epoch-based memory reclamation + lock-free hash map (Harris-Michael) in Rust, checked with loom, Miri and ThreadSanitizer. Part of Cortex-9.
rust concurrency hashmap lock-free loom miri epoch-based-reclamation thread-sanitizer memory-reclamation cortex9
-
Updated
Oct 22, 2026 - Rust
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.
map c-plus-plus set cpp atomic containers cpp11 hash-map red-black-tree concurrent lock-free mpmc no-dependencies thread-safe unordered-map memory-reclamation hazard-pointers epoch-reclamation
-
Updated
Aug 14, 2026 - C++
A C++ lock-free containers library.
-
Updated
Sep 27, 2026 - C++
Add this topic to your repo
To associate your repository with the memory-reclamation topic, visit your repo's landing page and select "manage topics."