rusnikola / lfqueueLinks
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
☆60Updated 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☆121Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Library for lock-free locks☆82Updated 2 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- ☆108Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- ☆44Updated 4 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Benchmarks for our memory allocator☆68Updated last year
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- ☆20Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Effective Memory Reclamation☆58Updated 5 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆35Updated last year
- Hyaline Reclamation (PLDI '21, PODC '19)☆22Updated 4 years ago
- Concurrent trie-hash map library☆92Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆41Updated last year
- User-space Page Management☆109Updated 11 months ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 3 years ago
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆48Updated 4 years ago
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆79Updated 7 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago