Alternatives and similar repositories for lockfree-linked-list

Users that are interested in lockfree-linked-list are comparing it to the libraries listed below

• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆137Updated last month
• rmind / thmap
  Concurrent trie-hash map library
  ☆93Updated 2 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated last year
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆17Updated 11 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
• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 5 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 5 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆32Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆81Updated 4 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• google / hashtable-benchmarks
  ☆111Updated last year
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆165Updated 4 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆100Updated 7 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 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
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆35Updated 5 years ago
• rmind / tlsf
  TLSF: two-level segregated fit O(1) allocator
  ☆80Updated 3 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆63Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• WojciechMula / base64simd
  Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)
  ☆170Updated 9 months ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 2 weeks ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 12 years ago