Alternatives and similar repositories for Interval-Based-Reclamation:

Users that are interested in Interval-Based-Reclamation are comparing it to the libraries listed below

• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆19Updated 7 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 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
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆35Updated 4 years ago
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• 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
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 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
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 5 months ago
• utsaslab / rustfs
  A Rust user-space file system [WIP]
  ☆29Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• efficient / qlease
  ☆24Updated 10 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 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
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 11 months ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• acharapko / fleetdb
  ☆12Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• jkopinsky / SprayList
  The SprayList data structure
  ☆32Updated 8 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago