urcs-sync / rallocLinks
Recoverable lock-free allocator based on LRMalloc
☆47Updated 5 years ago
Alternatives and similar repositories for ralloc
Users that are interested in ralloc are comparing it to the libraries listed below
Sorting:
- A simple, reference implementation of a B^e-tree☆158Updated 6 years ago
- NVM Database from Carnegie-Mellon U☆24Updated 5 years ago
- pmwcas☆138Updated 2 years ago
- A Write-friendly and Cache-optimized Hashing Scheme for Non-volatile Memory Systems (MSST 2017, TPDS 2018)☆30Updated 7 years ago
- A fast in-memory key-value store☆51Updated 8 years ago
- Library for lock-free locks☆83Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆132Updated 7 months ago
- Official public repository for TinySTM (tmware.org)☆49Updated 10 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- ☆30Updated 3 years ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- Remote Persistent Memory Access Library☆104Updated 2 years ago
- ☆25Updated 9 years ago
- GCC port of TM system Mnemosyne☆32Updated 7 years ago
- ☆21Updated 8 years ago
- The Cicada engine☆59Updated 8 years ago
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated last year
- ☆55Updated last year
- Software Transactional Objects☆56Updated last year
- MapReduce for multi-core☆49Updated 12 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 6 months ago
- ☆48Updated last year
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆51Updated 4 years ago
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆16Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- QSBR and EBR library☆133Updated 5 years ago