Alternatives and similar repositories for synchrobench:

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

• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆179Updated 7 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆139Updated 5 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆439Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• ahorn / linearizability-checker
  Fast linearizability checker
  ☆66Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• pramalhe / ConcurrencyFreaks
  ☆430Updated last year
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆212Updated last year
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆207Updated 9 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆386Updated 7 years ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆32Updated 7 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆114Updated 2 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 7 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 4 months ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 2 years ago
• chaoran / fast-wait-free-queue
  A benchmark framework for concurrent queue implementations
  ☆289Updated 4 years ago
• yxymit / DBx1000
  ☆284Updated 2 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.
  ☆157Updated 3 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆134Updated 4 years ago
• efficient / epaxos
  ☆617Updated 3 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆74Updated 6 years ago
• pmem / pmemkv
  Key/Value Datastore for Persistent Memory
  ☆399Updated last year
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 2 months ago
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆253Updated 6 years ago
• memkind / memkind
  Memkind is an easy-to-use, general-purpose allocator which helps to fully utilize various kinds of memory available in the system, includ…
  ☆382Updated 9 months ago