Alternatives and similar repositories for michael-alloc

Users that are interested in michael-alloc are comparing it to the libraries listed below

• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆58Updated last year
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 3 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆60Updated 6 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆65Updated last year
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆46Updated 3 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• ppetr / lockfree-userspace-rcu
  Lock-free RCU (Read-Copy-Update) user-space library
  ☆10Updated last year
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• boostorg / boost_unordered_benchmarks
  ☆21Updated 8 months ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• piperchester / cpp-btree
  Optimized for systems that read and write large blobs.
  ☆12Updated 10 years ago
• sysprog21 / fiber
  A User Space Threading Library
  ☆19Updated last year
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• neumannt / exceptionperformance
  performance experiments for C++ exception handling
  ☆30Updated 3 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• google-research / automemcpy
  ☆20Updated 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/ …
  ☆42Updated 10 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• GorNishanov / coroutines-ts
  ☆21Updated 6 years ago
• drepper / allocmap
  ☆21Updated 7 years ago
• cmpxchg16 / tsx.me
  Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox
  ☆24Updated 11 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆29Updated last year
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• dcdillon / cpuaff
  C++ interface to CPU affinity management
  ☆30Updated 7 years ago
• cameron314 / microbench
  A lightweight (3 file, single function) library for running micro-benchmarks on C++ code
  ☆82Updated 9 years ago