urcs-sync / Interval-Based-ReclamationLinks
Artifact for PPoPP'18
☆19Updated 3 years ago
Alternatives and similar repositories for Interval-Based-Reclamation
Users that are interested in Interval-Based-Reclamation are comparing it to the libraries listed below
Sorting:
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- The Cicada engine☆59Updated 8 years ago
- Nonblocking data structures☆12Updated 10 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- ☆12Updated 6 years ago
- Dependably fast multi-core in-memory transactions☆21Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- A Rust user-space file system [WIP]☆29Updated 4 years ago
- ☆15Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- Persistent Memory Storage Engine☆24Updated 11 months ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆35Updated 5 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- ☆30Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆55Updated 5 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 10 years ago
- NOPaxos consensus protocol☆138Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago