rusnikola / lfqueueLinks
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
☆62Updated last year
Alternatives and similar repositories for lfqueue
Users that are interested in lfqueue are comparing it to the libraries listed below
Sorting:
- QSBR and EBR library☆125Updated 5 years ago
- Library for lock-free locks☆82Updated 2 years ago
- ☆44Updated 4 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆22Updated 4 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- ☆109Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 12 years ago
- Benchmarks for our memory allocator☆69Updated last year
- ☆20Updated 2 years ago
- Concurrent trie-hash map library☆92Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆134Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Effective Memory Reclamation☆59Updated 5 years ago
- User-space Page Management☆108Updated last year
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆37Updated last year
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- A wall-clock stack-sampling profiler that actually works☆64Updated last year
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆41Updated last year
- Library for Restartable Sequences☆73Updated 3 weeks ago
- Our open source benchmarks and code samples☆192Updated 2 months ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆78Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆281Updated 2 weeks ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- ☆62Updated 10 months ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago