stephentu / scalex
Code snippets for the workshop on concurrent data structure implementation.
☆31Updated 12 years ago
Alternatives and similar repositories for scalex:
Users that are interested in scalex are comparing it to the libraries listed below
- ☆12Updated 6 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- The Cicada engine☆55Updated 7 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago
- ☆20Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- Persistent Memory Storage Engine☆24Updated 4 months ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- LSM-trie☆113Updated 4 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 6 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- ☆25Updated 8 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- ☆116Updated 2 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
- Dependably fast multi-core in-memory transactions☆19Updated 7 years ago
- Diamond reactive programming platform☆25Updated 2 years ago
- ☆28Updated 2 years ago
- Quickstep project☆42Updated 4 months ago
- NVM Evaluation Testbed☆29Updated 6 years ago