Alternatives and similar repositories for nonblocking:

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

• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆39Updated 2 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆18Updated 2 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 2 months ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆19Updated 7 years ago
• HewlettPackard / gull
  a multi-node fabric-attached memory manager that provides simple abstractions for accessing and allocating NVM from fabric-attached memor…
  ☆9Updated 7 months ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago
• camsas / Musketeer
  The Musketeer workflow manager.
  ☆41Updated 6 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆29Updated 6 years ago
• vmware-archive / go-redis-pmem
  Go Version of Redis on PMEM
  ☆12Updated 3 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago
• aajayssingh / concurrent-persistent-datastructure
  The rep contains my experiments with state of the art NVM programming abstractions during my internship at Regal Lab of Inria Paris under…
  ☆11Updated 4 years ago
• efficient / qlease
  ☆24Updated 10 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• HewlettPackard / mds
  Managed Data Structures
  ☆27Updated 7 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆15Updated 4 years ago
• DBOS-project / dbos-scheduler
  ☆26Updated 3 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• UWSysLab / diamond
  Diamond reactive programming platform
  ☆25Updated 2 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆22Updated 3 months ago