LPD-EPFL / ASCYLIB
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.
☆179Updated 7 years ago
Alternatives and similar repositories for ASCYLIB:
Users that are interested in ASCYLIB are comparing it to the libraries listed below
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆207Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- LSM-trie☆113Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- ☆143Updated 2 years ago
- ☆116Updated 2 years ago
- pmwcas☆135Updated last year
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆213Updated last year
- A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).☆76Updated 3 years ago
- QSBR and EBR library☆118Updated 5 years ago
- LiTL: Library for Transparent Lock Interposition☆79Updated last year
- A simple, reference implementation of a B^e-tree☆152Updated 5 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆114Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 5 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- Source code for our OSDI 2016 paper☆110Updated 6 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆78Updated 2 years ago
- Beta release of Masstree.☆440Updated last year
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆154Updated 11 months ago