mfs409 / nonblockingLinks
Nonblocking data structures
☆12Updated 10 years ago
Alternatives and similar repositories for nonblocking
Users that are interested in nonblocking are comparing it to the libraries listed below
Sorting:
- Artifact for PPoPP'18☆19Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Persistent Memory Storage Engine☆24Updated last year
- Dependably fast multi-core in-memory transactions☆21Updated 8 years ago
- ☆48Updated last year
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆31Updated 4 years ago
- Atlas: Programming for Persistent Memory☆76Updated 5 years ago
- User-space Page Management☆111Updated last year
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆159Updated 6 years ago
- Python bindings for the PMDK. Non-volatile memory for Python.☆13Updated 2 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆16Updated 3 years ago
- ☆30Updated 3 years ago
- ☆33Updated 8 years ago
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆44Updated 3 months ago
- Go Version of Redis on PMEM☆12Updated 3 years ago
- Diamond reactive programming platform☆26Updated 3 years ago
- ☆12Updated 6 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆83Updated 3 years ago
- Library for Restartable Sequences☆74Updated 3 weeks ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 6 years ago
- ☆55Updated last year
- ☆28Updated 4 years ago
- Quicksilver superpage management system☆11Updated 4 years ago