Alternatives and similar repositories for lfqueue:

Users that are interested in lfqueue are comparing it to the libraries listed below

• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆20Updated 3 years ago
• DolevAdas / Jiffy
  ☆42Updated 4 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆38Updated 7 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆76Updated last year
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆63Updated last year
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆53Updated 4 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆117Updated 5 years ago
• RobertLeahy / AsioUring
  ☆58Updated 3 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆43Updated 11 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆30Updated 7 months ago
• ppetr / lockfree-userspace-rcu
  Lock-free RCU (Read-Copy-Update) user-space library
  ☆10Updated last year
• Donald-Rupin / zab
  C++20 liburing backed coroutine executor and event loop framework.
  ☆66Updated 2 years ago
• boostorg / boost_unordered_benchmarks
  ☆17Updated 3 months ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• LLNL / umap
  User-space Page Management
  ☆106Updated 5 months ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years 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
• google / hashtable-benchmarks
  ☆104Updated last year
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆121Updated 5 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• zxjcarrot / uproc
  userspace /proc filesystem
  ☆12Updated 3 years ago
• romange / gaia
  C++ framework for rapid server development
  ☆77Updated 11 months ago