rusnikola / lfsmrLinks
Hyaline Reclamation (PLDI '21, PODC '19)
☆22Updated 4 years ago
Alternatives and similar repositories for lfsmr
Users that are interested in lfsmr are comparing it to the libraries listed below
Sorting:
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆79Updated 7 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- ☆12Updated 2 years ago
- ☆12Updated 4 years ago
- ☆110Updated last year
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- QSBR and EBR library☆127Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- ☆20Updated 2 years ago
- Software transactional memory system developed at Wyatt Technology☆29Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Benchmarks for our memory allocator☆69Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- RLU resizable hash-table☆17Updated 10 years ago
- A wall-clock stack-sampling profiler that actually works☆65Updated last year
- Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-cost…☆27Updated 3 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- Concurrent trie-hash map library☆92Updated last year
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 6 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago