Alternatives and similar repositories for lockfree-linked-list:

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

• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆27Updated last year
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆45Updated 11 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆63Updated last year
• node-dot-cpp / alloc-test
  Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
  ☆45Updated 6 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆42Updated last year
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆39Updated 9 months 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
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆74Updated 3 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 5 years ago
• pabloariasal / couring
  C++20 Coroutines and io_uring
  ☆48Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• 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
  ☆52Updated last year
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆157Updated 3 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆32Updated 9 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• boostorg / boost_unordered_benchmarks
  ☆18Updated 4 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• google-research / automemcpy
  ☆20Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆77Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 2 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 2 years ago