rusnikola / lfqueueLinks
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
☆71Updated 2 years ago
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☆134Updated 6 years ago
- Library for lock-free locks☆83Updated 2 years ago
- ☆44Updated 4 years ago
- Benchmarks for our memory allocator☆70Updated 2 years ago
- ☆112Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Effective Memory Reclamation☆63Updated 5 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆23Updated 4 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆47Updated 12 years ago
- The world's first wait-free Software Transactional Memory☆174Updated 5 years ago
- Concurrent trie-hash map library☆93Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆139Updated 2 months ago
- Fast Approximate Membership Filters (C++)☆288Updated 3 months ago
- ☆20Updated 2 years ago
- ☆66Updated last year
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆41Updated last year
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆42Updated last year
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Comparing linear and binary searches☆43Updated 5 years ago
- Concurrent Deferred Reference Counting☆173Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆160Updated 6 years ago
- Lightweight locality-aware user-level threading runtime.☆197Updated last month
- C++20 Coroutines and io_uring☆53Updated 3 years ago