Recoverable lock-free allocator based on LRMalloc
☆48Oct 23, 2020Updated 5 years ago
Alternatives and similar repositories for ralloc
Users that are interested in ralloc are comparing it to the libraries listed below
Sorting:
- Montage is a system for building fast buffered persistent data structures on nonvolatile memory.☆16Jun 9, 2022Updated 3 years ago
- ☆19Sep 5, 2019Updated 6 years ago
- ☆25Aug 1, 2016Updated 9 years ago
- A lock-free malloc(3) implementation☆20Jun 15, 2025Updated 8 months ago
- Atlas: Programming for Persistent Memory☆77Nov 22, 2020Updated 5 years ago
- pmwcas☆139Apr 7, 2023Updated 2 years ago
- Source Code for 'Programming Persistent Memory: A Comprehensive Guide for Developers' by Steve Scargall☆112Nov 19, 2021Updated 4 years ago
- Understanding the Idiosyncrasies of Real Persistent Memory☆33Aug 18, 2021Updated 4 years ago
- ☆31Sep 23, 2015Updated 10 years ago
- Eurosys22' - Rolis: a software approach to efficiently replicating multi-core transactions☆17Feb 28, 2024Updated last year
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- Artifact for PPoPP'18☆19Apr 11, 2022Updated 3 years ago
- C++ bindings & containers for libpmemobj☆110Mar 22, 2023Updated 2 years ago
- Code for "Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, and Erez Petrank. Efficient Lock-Free Durable Sets, OOPSLA 2019" (ht…☆19Jan 30, 2020Updated 6 years ago
- ☆18Mar 23, 2022Updated 3 years ago
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆46Aug 12, 2025Updated 6 months ago
- Library for lock-free locks☆84Jun 26, 2023Updated 2 years ago
- Persistent memory allocator for data-centric analytics☆60Oct 31, 2025Updated 3 months ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Mar 18, 2021Updated 4 years ago
- Golang library for using persistent memory☆29Oct 7, 2022Updated 3 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆162Jun 23, 2025Updated 8 months ago
- The concurrent skip list is a multithreaded implementation of the skip list data structure where the insert, delete, get and range operat…☆24Jan 11, 2021Updated 5 years ago
- ☆30Sep 14, 2022Updated 3 years ago
- Fast In-memory Transaction Processing using Hybrid RDMA Primitives☆66Nov 15, 2018Updated 7 years ago
- Apple XNU WKdm fast memory page compressor☆34Oct 26, 2013Updated 12 years ago
- The classic STREAM benchmark, extended to measure NUMA effects.☆38Aug 8, 2019Updated 6 years ago
- Scalable Hashing on Persistent Memory☆194Apr 16, 2024Updated last year
- GCC port of TM system Mnemosyne☆32Oct 29, 2018Updated 7 years ago
- Scaling Up Memory Disaggregated Applications with SMART☆34Apr 23, 2024Updated last year
- ☆33Oct 9, 2017Updated 8 years ago
- ☆120May 3, 2021Updated 4 years ago
- Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)☆204Jul 20, 2020Updated 5 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Aug 16, 2011Updated 14 years ago
- QSBR and EBR library☆135Dec 15, 2019Updated 6 years ago
- A Rust library for safely programming persistent memory☆75Jun 6, 2024Updated last year
- ☆36Mar 28, 2023Updated 2 years ago
- ☆39Feb 2, 2021Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆48Sep 13, 2013Updated 12 years ago