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
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- QSBR and EBR library☆117Updated 5 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- Malloc replacement with support for shared and persistent memory allocation☆33Updated 10 years ago
- portability macros for compiler and hardware micro operations☆35Updated 7 months ago
- 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
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- C++ interface to CPU affinity management☆30Updated 6 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆79Updated 9 years ago
- Concurrent trie-hash map library☆91Updated last year
- A fast in-memory key-value store☆49Updated 7 years ago
- benchmarking positional population count☆14Updated 11 months ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆45Updated 5 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 3 years ago
- Benchmarks for our memory allocator☆63Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆73Updated 10 years ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- testing latencies of various linux thread synchronization primitives☆18Updated 7 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆87Updated 3 years ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 2 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- STL-compliant map and set container based on a C++11 Adaptive Radix Tree implementation.☆11Updated 8 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago