Alternatives and similar repositories for ASCYLIB

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

• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆208Updated 9 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆119Updated 5 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.
  ☆159Updated 3 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 7 months ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆135Updated 4 years ago
• trigonak / ccbench
  A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).
  ☆78Updated 3 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆144Updated 2 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆140Updated 5 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 7 years ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆441Updated last year
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆79Updated 3 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆75Updated 6 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago