Alternatives and similar repositories for lockfree-linked-list

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

• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• 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
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆68Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 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
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆30Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• 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
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆29Updated last year
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• dbittman / waitfree-mpsc-queue
  A wait-free multi-producer-single-consumer queue in C11 atomics
  ☆226Updated 3 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.
  ☆166Updated 3 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• node-dot-cpp / alloc-test
  Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
  ☆46Updated 6 years ago
• eapache / wof_alloc
  Fast C/C++ memory allocator with free-all operation
  ☆55Updated 10 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆78Updated 3 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• google / hashtable-benchmarks
  ☆108Updated last year
• 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
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆44Updated last year
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆41Updated last year
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago