HagarMeir / transactionLib
Transactional Data Structure Libraries
☆12Updated 7 years ago
Alternatives and similar repositories for transactionLib:
Users that are interested in transactionLib are comparing it to the libraries listed below
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12Updated 8 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Artifact for PPoPP'18☆18Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Dependably fast multi-core in-memory transactions☆19Updated 7 years ago
- ☆10Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 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
- The Cicada engine☆55Updated 7 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- Parallel sections library for parallel data-structures☆14Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- RLU resizable hash-table☆16Updated 9 years ago
- ☆20Updated 2 years ago
- ☆14Updated last year
- A fast in-memory key-value store☆49Updated 7 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- Hyaline Reclamation (PLDI '21, PODC '19)☆20Updated 3 years ago
- ☆52Updated 9 months ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 2 years ago
- ☆12Updated 6 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- Persistent Memory Graph Database☆44Updated 2 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆29Updated 6 years ago