compudj / librseqLinks
Library for Restartable Sequences
☆73Updated last month
Alternatives and similar repositories for librseq
Users that are interested in librseq are comparing it to the libraries listed below
Sorting:
- User-space Page Management☆109Updated 11 months ago
- Generic Automatic Parallel Profiler☆35Updated 4 years ago
- QSBR and EBR library☆121Updated 5 years ago
- A simple, reference implementation of a B^e-tree☆155Updated 6 years ago
- Testing memory-level parallelism☆79Updated last year
- An intel PT trace converter from `perf.data` to Fuchsia trace format.☆62Updated 3 months ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- ☆108Updated last year
- Source code for example programs from Lord of the io_uring guide☆185Updated last year
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆79Updated 7 years ago
- A Rust library for safely programming persistent memory☆74Updated last year
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Tools and Reference Code for Intel Optimizations (eg Large Pages)☆145Updated 10 months ago
- LiTL: Library for Transparent Lock Interposition☆83Updated 2 years ago
- A wall-clock stack-sampling profiler that actually works☆64Updated last year
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- CrashMonkey: tools for testing file-system reliability (OSDI 18)☆201Updated 2 years ago
- An advanced benchmarking tool☆182Updated this week
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆76Updated 4 years ago
- Using io_uring to implement a user space Linux fuse server☆46Updated 4 years ago
- ☆48Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 6 years ago
- COW b-trees☆102Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Concurrent trie-hash map library☆92Updated last year
- Blog and pages generated by Jekyll. Hosted on GitHub.☆57Updated last week
- Programatically obtain information about the pages backing a given memory region☆78Updated 3 years ago