Alternatives and similar repositories for concurrent-data-structures

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

• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆32Updated 12 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆181Updated 7 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 15 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 5 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆143Updated 6 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆139Updated 5 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆99Updated 7 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆158Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆43Updated 9 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 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.
  ☆165Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 6 years ago
• AugmentedTimeProject / AugmentedTimeProject
  A project to implement Augmented Time
  ☆49Updated 11 years ago
• gramoli / synchrobench
  A benchmark to compare synchronization techniques for multicore programming
  ☆348Updated 4 months ago