ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists, binary search trees, queues, and stacks.
☆182Jan 19, 2018Updated 8 years ago
Alternatives and similar repositories for ASCYLIB
Users that are interested in ASCYLIB are comparing it to the libraries listed below
Sorting:
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Oct 4, 2021Updated 4 years ago
- A benchmark to compare synchronization techniques for multicore programming☆348Jul 3, 2025Updated 7 months ago
- ☆126Apr 8, 2022Updated 3 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Aug 31, 2015Updated 10 years ago
- RLU resizable hash-table☆17Aug 24, 2015Updated 10 years ago
- LiTL: Library for Transparent Lock Interposition☆86Jun 29, 2023Updated 2 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Feb 26, 2022Updated 4 years ago
- FOEDUS main source code repository☆64Jun 26, 2017Updated 8 years ago
- Cross-platform atomic operations and lock algorithm library☆99Aug 29, 2018Updated 7 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆213Jan 18, 2016Updated 10 years ago
- Nonblocking data structures☆12Jan 25, 2015Updated 11 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Mar 28, 2017Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- An open sourced implementation of Bw-Tree in SQL Server Hekaton☆526Nov 14, 2018Updated 7 years ago
- ☆99Nov 19, 2020Updated 5 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆32Feb 27, 2013Updated 13 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆22Apr 16, 2025Updated 10 months ago
- Code for "Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, and Erez Petrank. Efficient Lock-Free Durable Sets, OOPSLA 2019" (ht…☆19Jan 30, 2020Updated 6 years ago
- pmwcas☆139Apr 7, 2023Updated 2 years ago
- Beta release of Masstree.☆457Oct 15, 2023Updated 2 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Jul 8, 2019Updated 6 years ago
- Library for lock-free locks☆84Jun 26, 2023Updated 2 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Oct 15, 2024Updated last year
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆46Aug 12, 2025Updated 6 months ago
- ☆25Aug 1, 2016Updated 9 years ago
- The Cicada engine☆59Jun 16, 2017Updated 8 years ago
- MapReduce for multi-core☆50Sep 16, 2013Updated 12 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Dec 11, 2022Updated 3 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 years ago
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- ☆290Dec 28, 2022Updated 3 years ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆36Jul 7, 2020Updated 5 years ago
- ☆16Jan 24, 2025Updated last year
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24May 4, 2015Updated 10 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Mar 12, 2021Updated 4 years ago
- Concurrency Control Benchmark☆49Sep 3, 2023Updated 2 years ago
- This repo is a mirror of the official userspace-rcu git found at git://git.lttng.org/userspace-rcu.git. liburcu is a LGPLv2.1 userspace R…☆717Jan 26, 2026Updated last month