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)
  ☆211Updated 9 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• gramoli / synchrobench
  A benchmark to compare synchronization techniques for multicore programming
  ☆348Updated 3 months ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 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.
  ☆166Updated 4 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 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
• HewlettPackard / Atlas
  Atlas: Programming for Persistent Memory
  ☆76Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆99Updated 7 years ago
• flode / ARTSynchronized
  ☆122Updated 3 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 7 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆446Updated 2 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆138Updated 4 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)
  ☆82Updated 3 years ago
• multicore-locks / litl
  LiTL: Library for Transparent Lock Interposition
  ☆84Updated 2 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆63Updated 8 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆127Updated 5 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• hyrise / nvm_malloc
  ☆25Updated 9 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago