Alternatives and similar repositories for Hazard-Pointers

Users that are interested in Hazard-Pointers are comparing it to the libraries listed below

• bytemaster / fc_malloc
  Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.
  ☆183Updated 12 years ago
• frechilla / misc-playground
  Miscellaneous scripts and things that dont merit their own repo. All under MIT License unless otherwise specified
  ☆31Updated 3 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆184Updated last year
• greg7mdp / dlmalloc
  C++ version of Doug Lea's excellent malloc() implementation.
  ☆153Updated 6 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• baruch / libwire
  User space threading (aka coroutines) library for C resembling GoLang and goroutines
  ☆166Updated 7 years ago
• malbrain / rwlock
  Phase Fair and Standard Reader Writer Locks
  ☆17Updated 6 years ago
• Lupus / libevfibers
  Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.
  ☆139Updated 6 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 9 years ago
• tylertreat / gatling
  Minimal pub/sub message queue in C.
  ☆23Updated 11 years ago
• eapache / wof_alloc
  Fast C/C++ memory allocator with free-all operation
  ☆55Updated 10 years ago
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆80Updated 9 years ago
• samanbarghi / MPSCQ
  An intrusive lock-free multiple-producer, single-consumer queue in C++
  ☆52Updated 9 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆78Updated 11 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆52Updated 4 years ago
• semistrict / libcoro
  Lightweight C coroutines (derived from http://software.schmorp.de/pkg/libcoro.html)
  ☆125Updated last year
• berenm / bplus-tree
  Fast in-memory B+-Tree implementation in C.
  ☆30Updated 10 years ago
• skywind3000 / memslab
  Slab Memory Allocator in Application Layer
  ☆28Updated 7 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• goossaert / hashmap
  Various open addressing hashmap algorithms in C++
  ☆257Updated 3 years ago
• mpictor / judy-template
  An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …
  ☆45Updated 10 years ago
• cleeus / obstack
  A C++ pointer bump memory arena implementation
  ☆94Updated 10 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated 2 years ago
• malbrain / ARTful
  ARTful radix tree
  ☆13Updated 8 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 years ago
• xant / libiomux
  iomux - High performance aynchronous I/O multiplexing and timers
  ☆16Updated last month
• RafaGago / mini-async-log-c
  Mini async log C port. Now with C++ wrappers.
  ☆74Updated 2 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• arneg / GJAlloc
  a fast fixed size block allocator
  ☆20Updated 10 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago