LPD-EPFL / ASCYLIBLinks
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.
☆180Updated 7 years ago
Alternatives and similar repositories for ASCYLIB
Users that are interested in ASCYLIB are comparing it to the libraries listed below
Sorting:
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆211Updated 9 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- A benchmark to compare synchronization techniques for multicore programming☆348Updated 3 months ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).☆78Updated 3 years ago
- Atlas: Programming for Persistent Memory☆76Updated 4 years ago
- pmwcas☆138Updated 2 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- ☆122Updated 3 years ago
- A transactional main-memory database system on multicores☆104Updated 7 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- Beta release of Masstree.☆446Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- NOPaxos consensus protocol☆138Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- LiTL: Library for Transparent Lock Interposition☆84Updated 2 years ago
- FOEDUS main source code repository☆63Updated 8 years ago
- QSBR and EBR library☆127Updated 5 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- A fast in-memory key-value store☆51Updated 8 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- NVM Evaluation Testbed☆29Updated 7 years ago
- ☆149Updated 2 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- ☆25Updated 9 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago