Alternatives and similar repositories for concurrent-locking

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

• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆60Updated 6 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 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
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 3 years ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆24Updated 10 years ago
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆29Updated last year
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆56Updated 5 years ago
• google / berrydb
  ☆66Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• pgoodman / rcu
  C++ implementation of RCU based on reference counting and hazard pointers.
  ☆27Updated 12 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• ucf-cs / tlds
  Lock-free Transactions without Rollbacks for Linked Data Structures
  ☆22Updated 2 years ago
• romange / gaia
  C++ framework for rapid server development
  ☆77Updated last year
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆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. …
  ☆30Updated 14 years ago
• pabloariasal / couring
  C++20 Coroutines and io_uring
  ☆51Updated 2 years ago
• pabuhr / uCPP
  concurrency for C++
  ☆161Updated 5 months ago
• brycelelbach / coroutines_ts_v1_experience
  Infomation about C++ Coroutines TS v1 software and content
  ☆9Updated 6 years ago
• Donald-Rupin / zab
  C++20 liburing backed coroutine executor and event loop framework.
  ☆66Updated 3 years ago