laysakura / Lock-free_work-stealing_deque_in_CLinks
Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."
☆19Updated 14 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:
- QSBR and EBR library☆135Updated 6 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- Different implementations of spinlock.☆105Updated 11 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆78Updated 11 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 4 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆48Updated 12 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- The world's first Web-scale memory allocator☆109Updated 7 years ago
- Our open source benchmarks and code samples☆193Updated 2 months ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Malloc replacement with support for shared and persistent memory allocation☆33Updated 11 years ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆141Updated 2 years ago
- portability macros for compiler and hardware micro operations☆36Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆80Updated 9 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆84Updated 10 years ago
- Lock-free Transactions without Rollbacks for Linked Data Structures☆23Updated 3 years ago
- C11 Lock-free Stack☆184Updated last year
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 12 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆138Updated 6 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆90Updated 3 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- Coroutines/Fibers implementation for x86☆65Updated 9 years ago