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)
  ☆63Updated last year
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 11 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆33Updated last year
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• amdn / itoa
  World's fastest integer to ASCII conversion, C++14 template meta-programming implementation, any size integer 8,16,32,64-bit, signed or u…
  ☆27Updated 9 years ago
• gstrauss / plasma
  portability macros for compiler and hardware micro operations
  ☆36Updated last year
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆69Updated 2 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆30Updated 2 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆77Updated 11 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 3 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆125Updated 5 years ago
• laudrup / lz4_stream
  A C++ stream using LZ4 (de)compression
  ☆39Updated 3 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆52Updated 3 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
  ☆53Updated last year
• WojciechMula / base64simd
  Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)
  ☆169Updated 7 months ago
• cameron314 / microbench
  A lightweight (3 file, single function) library for running micro-benchmarks on C++ code
  ☆83Updated 9 years ago
• ChrisDodd / shm_malloc
  Malloc replacement with support for shared and persistent memory allocation
  ☆32Updated 11 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• google-research / automemcpy
  ☆22Updated 3 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆183Updated last year
• bytemaster / fc_malloc
  Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.
  ☆179Updated 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/ …
  ☆43Updated 10 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆88Updated 3 years ago
• laysakura / Lock-free_work-stealing_deque_in_C
  Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."
  ☆19Updated 14 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆61Updated 5 years ago