urcs-sync / Interval-Based-Reclamation
Artifact for PPoPP'18
☆17Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for Interval-Based-Reclamation
- Dependably fast multi-core in-memory transactions☆19Updated 7 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
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- Persistent Memory Storage Engine☆24Updated 2 weeks ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- The Cicada engine☆56Updated 7 years ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆35Updated 4 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- ☆21Updated last year
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆47Updated 9 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Experiments in partially ordered SMR.☆46Updated 3 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆40Updated 8 years ago
- Nonblocking data structures☆12Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- ☆10Updated 3 years ago
- An RDMA-powered, fast, and scalable Paxos protocol☆25Updated 5 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 8 years ago
- ☆12Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆33Updated 5 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆14Updated 5 years ago
- ☆27Updated 2 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago