Alternatives and similar repositories for nonblocking

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

• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 3 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 9 months ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• tuhhosg / exmap
  ☆48Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 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
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 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
• oscarlab / versioning
  Framework for creating simple, efficient, and composable lock-free data structures
  ☆12Updated 9 years ago
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• LLNL / umap
  User-space Page Management
  ☆108Updated last year
• ix-project / zygos
  ☆32Updated 7 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆20Updated 8 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 6 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• UWSysLab / diamond
  Diamond reactive programming platform
  ☆26Updated 3 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 2 years ago
• DBOS-project / dbos-scheduler
  ☆28Updated 4 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆15Updated 3 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)
  ☆81Updated 3 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆55Updated 4 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• ut-osa / txfs
  TxFS: Leveraging File-System Crash Consistency to Provide ACID Transactions (ATC 18)
  ☆66Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• hku-systems / apus
  An RDMA-powered, fast, and scalable Paxos protocol
  ☆25Updated 6 years ago