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
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Persistent Memory Storage Engine☆24Updated last year
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12Updated 9 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- Python bindings for the PMDK. Non-volatile memory for Python.☆13Updated 2 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 5 years ago
- LSM-trie☆114Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆16Updated 3 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 6 years ago
- ☆50Updated last year
- User-space Page Management☆111Updated last year
- ☆30Updated 3 years ago
- pmwcas☆139Updated 2 years ago
- Dependably fast multi-core in-memory transactions☆21Updated 8 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 15 years ago
- ☆12Updated 7 years ago
- TxFS: Leveraging File-System Crash Consistency to Provide ACID Transactions (ATC 18)☆66Updated 7 years ago
- NUMA-Aware Reader-Writer Locks☆18Updated 11 years ago
- An RDMA-powered, fast, and scalable Paxos protocol☆26Updated 6 years ago
- Atlas: Programming for Persistent Memory☆76Updated 5 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
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆44Updated 4 months ago
- Distributed Shared Persistent Memory. SoCC 2017☆69Updated 5 years ago
- ☆15Updated 5 years ago
- A fast in-memory key-value store☆52Updated 8 years ago