Alternatives and similar repositories for concurrent-locking

Users that are interested in concurrent-locking are comparing it to the libraries listed below

• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• google / hashtable-benchmarks
  ☆109Updated last year
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• google / berrydb
  ☆66Updated 4 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 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/ …
  ☆42Updated 10 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 9 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆125Updated 5 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• memsql / lockfree-bench
  Benchmarks for lockfree datastructures.
  ☆120Updated 11 years ago
• romange / gaia
  C++ framework for rapid server development
  ☆76Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆76Updated 11 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 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
  ☆54Updated last year
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆135Updated 6 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆30Updated 2 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 8 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• ucf-cs / tlds
  Lock-free Transactions without Rollbacks for Linked Data Structures
  ☆22Updated 3 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 12 years ago
• tabokie / coplus
  Parallel programming library in C++11
  ☆12Updated 5 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago