rusnikola / lfqueueLinks
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
☆57Updated last year
Alternatives and similar repositories for lfqueue
Users that are interested in lfqueue are comparing it to the libraries listed below
Sorting:
- Hyaline Reclamation (PLDI '21, PODC '19)☆21Updated 3 years ago
- ☆44Updated 4 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Library for lock-free locks☆80Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- QSBR and EBR library☆119Updated 5 years ago
- Effective Memory Reclamation☆55Updated 5 years ago
- Benchmarks for our memory allocator☆64Updated last year
- Programatically obtain information about the pages backing a given memory region☆77Updated 3 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆40Updated last year
- Concurrent trie-hash map library☆91Updated last year
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆31Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- ☆20Updated 2 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆34Updated last year
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆45Updated 6 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- ☆29Updated last month
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- User-space Page Management☆107Updated 9 months ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- C++20 Coroutines and io_uring☆51Updated 2 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox☆24Updated 10 years ago
- Quick sort code using AVX2 instructions☆69Updated 7 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- ☆106Updated last year