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
  ☆40Updated 3 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 2 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 4 months ago
• vmware-archive / go-redis-pmem
  Go Version of Redis on PMEM
  ☆12Updated 3 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• HewlettPackard / mds
  Managed Data Structures
  ☆27Updated 7 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 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 9 months ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 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
• 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
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• camsas / Musketeer
  The Musketeer workflow manager.
  ☆41Updated 6 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆19Updated 7 years ago
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 9 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• HewlettPackard / Atlas
  Atlas: Programming for Persistent Memory
  ☆75Updated 4 years ago
• UWSysLab / diamond
  Diamond reactive programming platform
  ☆25Updated 2 years ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆22Updated 5 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• efficient / qlease
  ☆24Updated 10 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• oscarlab / versioning
  Framework for creating simple, efficient, and composable lock-free data structures
  ☆12Updated 8 years ago