laysakura / Lock-free_work-stealing_deque_in_C
Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."
☆19Updated 13 years ago
Alternatives and similar repositories for Lock-free_work-stealing_deque_in_C
Users that are interested in Lock-free_work-stealing_deque_in_C are comparing it to the libraries listed below
Sorting:
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆73Updated 10 years ago
- portability macros for compiler and hardware micro operations☆36Updated 10 months ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆81Updated 9 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- QSBR and EBR library☆119Updated 5 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- For details, see the blog post:☆32Updated 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 User Space Threading Library Supporting Multi-Core Systems☆139Updated last year
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 3 months ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- Component-Model Framework in C++☆44Updated 9 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- The world's first Web-scale memory allocator☆106Updated 6 years ago
- Benchmarks for our memory allocator☆64Updated last year
- ☆17Updated 10 years ago
- Malloc replacement with support for shared and persistent memory allocation☆33Updated 11 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- C++ interface to CPU affinity management☆30Updated 7 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆78Updated 9 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆87Updated 3 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 7 years ago