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
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆77Updated 9 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 3 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆139Updated last year
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- Different implementations of spinlock.☆104Updated 10 years ago
- portability macros for compiler and hardware micro operations☆36Updated 8 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 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
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 2 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- Concurrent trie-hash map library☆91Updated last year
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆79Updated 9 years ago
- A simple fast MPMC obstruction-free linearizable concurrent queue for C (based on linux[futex]/gcc/x86_64)☆39Updated 4 years ago
- testing latencies of various linux thread synchronization primitives☆18Updated 8 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated last month
- 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
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- Malloc replacement with support for shared and persistent memory allocation☆33Updated 10 years ago
- Lock-free Transactions without Rollbacks for Linked Data Structures☆22Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- Benchmarks for our memory allocator☆63Updated last year