CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
☆170Oct 4, 2021Updated 5 years ago
Alternatives and similar repositories for CLHT
Users that are interested in CLHT are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆37Jun 8, 2016Updated 10 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆186Jan 19, 2018Updated 8 years ago
- ☆17Sep 26, 2022Updated 4 years ago
- ☆20Sep 12, 2025Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆195Oct 15, 2024Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆101Nov 19, 2020Updated 5 years ago
- ☆15Mar 31, 2022Updated 4 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆49Mar 18, 2021Updated 5 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Apr 21, 2023Updated 3 years ago
- pmwcas☆139Apr 7, 2023Updated 3 years ago
- [VLDB 2020] Scalable Hashing on Persistent Memory☆196Apr 16, 2024Updated 2 years ago
- ☆19May 26, 2023Updated 3 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆118Mar 12, 2021Updated 5 years ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆75Aug 7, 2020Updated 6 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- ☆18Sep 5, 2019Updated 7 years ago
- LB+-Tree implementation☆49Apr 4, 2021Updated 5 years ago
- Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)☆203Jul 20, 2020Updated 6 years ago
- Nonblocking data structures☆12Jan 25, 2015Updated 11 years ago
- Range Optimized Adaptive Radix Tree☆25Feb 1, 2023Updated 3 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- Benchmarking framework for index structures on persistent memory☆93Aug 10, 2026Updated 2 months ago
- ☆129May 25, 2026Updated 5 months ago
- A benchmark to compare synchronization techniques for multicore programming☆349Jul 3, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆49Aug 20, 2020Updated 6 years ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆44Dec 12, 2022Updated 3 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆79Mar 7, 2022Updated 4 years ago
- WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems (FAST 2017)☆24Apr 1, 2021Updated 5 years ago
- ☆30Sep 23, 2015Updated 11 years ago
- An open sourced implementation of Bw-Tree in SQL Server Hekaton☆532Nov 14, 2018Updated 7 years ago
- ☆28Mar 17, 2024Updated 2 years ago
- Universal Presentation: A Header-only C++ Library to Cout STL containers and more☆18Aug 14, 2023Updated 3 years ago
- ☆120May 15, 2023Updated 3 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Key-value store with new indexing☆34Sep 3, 2019Updated 7 years ago
- A Rust RDMA library.☆13Oct 16, 2026Updated 2 weeks ago
- C++ bindings & containers for libpmemobj☆111Mar 22, 2023Updated 3 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆26Jul 10, 2021Updated 5 years ago
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆16Jun 9, 2022Updated 4 years ago
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆48Jun 5, 2026Updated 4 months ago
- NoveLSM☆39Dec 6, 2018Updated 7 years ago