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)☆63Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 12 years ago
- QSBR and EBR library☆127Updated 5 years ago
- Benchmarks for our memory allocator☆69Updated 2 years ago
- For details, see the blog post:☆33Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 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
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- ☆109Updated last year
- Effective Memory Reclamation☆61Updated 5 years ago
- Library for lock-free locks☆83Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- ☆44Updated 4 years ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆46Updated 6 years ago
- benchmarking positional population count☆15Updated last year
- Fast C/C++ memory allocator with free-all operation☆55Updated 10 years ago
- Test if AVX vector loads and stores are atomic☆31Updated 5 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 3 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- SIMD (SSE) string functions☆102Updated 8 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆43Updated 10 years ago
- Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)☆169Updated 7 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago