Alternatives and similar repositories for sphinx:

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

• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• romange / midi-redis
  A toy memory store with great performance
  ☆33Updated 2 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆25Updated 10 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
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 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
• tuhhosg / exmap
  ☆40Updated 10 months ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆18Updated 2 years ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆22Updated 9 years ago
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆21Updated 10 months ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆41Updated this week
• PumpkinDB / rust-spdk
  Rust bindings for SPDK
  ☆19Updated 7 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆39Updated 8 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
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆65Updated 9 years ago
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆35Updated 4 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆98Updated 6 months ago
• penberg / ycsb-rs
  A Rust port of Yahoo! Cloud Serving Benchmark (YCSB)
  ☆28Updated 2 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆43Updated last year
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆27Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• belliottsmith / accord
  ☆26Updated 2 years ago