Alternatives and similar repositories for rlu

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

• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆154Updated 6 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
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆180Updated 7 years ago
• bitslab / ffwd
  This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.
  ☆79Updated 7 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 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
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆208Updated 9 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• mit-pdos / scalefs
  ☆21Updated 7 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 4 years ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆33Updated 8 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
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆42Updated 8 years ago
• ydmao / Metis
  MapReduce for multi-core
  ☆49Updated 11 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• columbia / crane
  Transparent Paxos
  ☆44Updated 6 years ago
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆88Updated 11 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• vrv / FAWN-KV
  A Distributed Key-Value Store for FAWN
  ☆77Updated 14 years ago
• ahorn / linearizability-checker
  Fast linearizability checker
  ☆66Updated 10 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 5 years ago