Alternatives and similar repositories for cuckoopp

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

• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆41Updated last year
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 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
  ☆121Updated 5 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆78Updated 3 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆76Updated 4 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• nokia / ClickNF
  ☆31Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• tcp-acceleration-service / tas
  TAS is a drop-in highly CPU efficient and scalable TCP acceleration service.
  ☆85Updated last year
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆61Updated 6 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• scality / quadiron
  Fast Erasure Coding Library for Large Number of Data and Parities
  ☆29Updated 5 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆58Updated 5 years ago
• ccp-project / libccp
  A library for implementing CCP-compatible datapaths.
  ☆28Updated 3 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 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.
  ☆164Updated 3 years ago
• papergitkeeper / heavy-keeper-project
  ☆33Updated 6 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆280Updated 6 months ago
• philipbecker / cpp-art
  STL-compliant map and set container based on a C++11 Adaptive Radix Tree implementation.
  ☆11Updated 8 years ago
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆55Updated last week
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 years ago
• ParaGroup / WindFlow
  A C++17 Data Stream Processing Parallel Library for Multicores and GPUs
  ☆85Updated 4 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• djkonro / afxdp
  AF_XDP Socket program
  ☆23Updated 6 years ago