parlab-tuwien / lockfree-linked-list
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
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆56Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago
- Concurrent trie-hash map library☆91Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Benchmarks for our memory allocator☆64Updated last year
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Volatile Persistent Memory Allocator☆25Updated 2 years ago
- A C11 implementation of D. Vyukov MPSC queue☆27Updated last year
- ☆20Updated 2 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 3 months ago
- For details, see the blog post:☆32Updated last year
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆34Updated 11 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- C++20 Coroutines and io_uring☆50Updated 2 years ago
- ☆44Updated 4 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 10 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆39Updated 11 months ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Test if AVX vector loads and stores are atomic☆29Updated 4 years ago
- ☆20Updated 6 months ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 3 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆30Updated 6 years ago
- A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.☆36Updated 10 months ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 7 years ago