parlab-tuwien / lockfree-linked-listLinks
A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
☆17Updated 5 years ago
Alternatives and similar repositories for lockfree-linked-list
Users that are interested in lockfree-linked-list are comparing it to the libraries listed below
Sorting:
- Concurrent trie-hash map library☆94Updated 2 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆48Updated 12 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆140Updated 2 months ago
- Benchmarks for our memory allocator☆70Updated 2 years ago
- QSBR and EBR library☆135Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- For details, see the blog post:☆35Updated 2 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- Library for lock-free locks☆83Updated 2 years ago
- ☆45Updated 5 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- TLSF: two-level segregated fit O(1) allocator☆82Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)☆170Updated 10 months ago
- ☆112Updated last year
- A C11 implementation of D. Vyukov MPSC queue☆33Updated 2 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆46Updated 6 years ago
- Test if AVX vector loads and stores are atomic☆35Updated 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 collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆42Updated last year
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 12 years ago
- Effective Memory Reclamation☆63Updated 5 years ago
- Fast C/C++ memory allocator with free-all operation☆55Updated 10 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆42Updated last year