Alternatives and similar repositories for Hazard-Pointers:

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

• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 8 years ago
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆77Updated 9 years ago
• PiotrSikora / libxs
  Crossroads I/O core library
  ☆19Updated 13 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• malbrain / rwlock
  Phase Fair and Standard Reader Writer Locks
  ☆17Updated 5 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆45Updated 3 years ago
• clibs / readline
  Tiny C readline library, note: this is not used in CLI-readline's one.
  ☆19Updated 9 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• skywind3000 / memslab
  Slab Memory Allocator in Application Layer
  ☆28Updated 7 years ago
• abique / melon
  M:N fiber implementation, with transparent IO reactor and timeouts, POSIX like APIs.
  ☆16Updated 12 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/ …
  ☆42Updated 10 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 7 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• dpw / skinny-mutex
  Low-memory-footprint mutexes for pthreads
  ☆40Updated 3 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• dcdillon / cpuaff
  C++ interface to CPU affinity management
  ☆30Updated 6 years ago
• Remotion / fmt_extension
  {fmt} support for ranges, containers and types with tuple interface.
  ☆27Updated 6 years ago
• zbjornson / fast-hex
  Fast, SIMD hex string encoder and decoder C++ lib and Node.js module
  ☆58Updated 2 years ago
• r-lyeh-archived / LRU
  A lightweight LRU cache structure for list<T> and map<K,V> containers. Written in C++11
  ☆27Updated 9 years ago
• bytemaster / fc_malloc
  Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.
  ☆175Updated 11 years ago
• willemt / linked-list-queue
  A simple queue using a linked list written in C under the BSD license.
  ☆18Updated 7 years ago
• gstrauss / plasma
  portability macros for compiler and hardware micro operations
  ☆36Updated 9 months ago
• boostorg / function
  Boost.org function module
  ☆24Updated 2 weeks ago
• rmind / tlsf
  TLSF: two-level segregated fit O(1) allocator
  ☆76Updated 2 years ago
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆38Updated last month
• samanbarghi / MPSCQ
  An intrusive lock-free multiple-producer, single-consumer queue in C++
  ☆51Updated 8 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• r-lyeh-archived / trie
  Trie is a lightweight and simple autocompletion data structure written in C++11.
  ☆44Updated 9 years ago