parlab-tuwien / lockfree-linked-listLinks
A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
☆17Updated 4 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☆92Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- For details, see the blog post:☆32Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆134Updated 5 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Benchmarks for our memory allocator☆68Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- QSBR and EBR library☆123Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- ☆44Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- A C11 implementation of D. Vyukov MPSC queue☆29Updated last year
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 10 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆41Updated last year
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- fast prime sieve and hash algorithm☆38Updated 2 months ago
- ☆108Updated last year
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆32Updated 7 years ago
- Test if AVX vector loads and stores are atomic☆30Updated 5 years ago
- TLSF: two-level segregated fit O(1) allocator☆80Updated 2 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- C++14 cache friendly B-heap priority queue☆105Updated 4 years ago