Alternatives and similar repositories for LockFreeHopscotchHashing:

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

• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated last week
• 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
• BU-DiSC / lethe-codebase
  ☆14Updated 3 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• ShawnZhong / MadFS
  Source code for the FAST '23 paper “MadFS: Per-File Virtualization for Userspace Persistent Memory Filesystems”
  ☆39Updated 2 years ago
• wyfunique / DBSim
  The codebase for DBSim
  ☆15Updated 2 years ago
• chloro-pn / tunnel
  Tunnel is a Pipeline Execution Engine based on C++20 coroutine
  ☆29Updated last year
• apc999 / libcuckoo
  A high-performance, concurrent hash table
  ☆24Updated 11 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• DBOS-project / dbos-scheduler
  ☆27Updated 3 years ago
• hydro-project / anna-cache
  A local cache for the Anna KVS
  ☆25Updated 4 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
• stonysystems / depfast-ae
  ☆19Updated 2 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• plasma-umass / sheriff
  Sheriff consists of two tools: Sheriff-Detect, a false-sharing detector, and Sheriff-Protect, a false-sharing eliminator that you can lin…
  ☆32Updated 6 years ago
• google-research / automemcpy
  ☆20Updated 2 years ago
• topling / topling-zip
  A data structure and algorithm library built for ToplingDB
  ☆57Updated 4 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 5 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• romange / midi-redis
  A toy memory store with great performance
  ☆34Updated 2 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆75Updated 4 years ago
• xelabs / ft-index
  TokuFT is a high-performance, transactional key-value store
  ☆19Updated 4 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆45Updated 2 years ago
• madsys-dev / async-spdk
  Asynchronous Rust bindings for SPDK.
  ☆16Updated 2 years ago