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☆121Updated 5 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆140Updated 2 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- Our open source benchmarks and code samples☆192Updated last month
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 3 years ago
- Concurrent trie-hash map library☆92Updated last year
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 9 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆88Updated 3 years ago
- C11 Lock-free Stack☆183Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- Malloc replacement with support for shared and persistent memory allocation☆33Updated 11 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆75Updated 11 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- portability macros for compiler and hardware micro operations☆36Updated last year
- Benchmarks for our memory allocator☆68Updated last year
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- The world's first Web-scale memory allocator☆108Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆78Updated 9 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆142Updated 2 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Lock-free multithreaded memory allocation☆107Updated 8 years ago
- A benchmark framework for concurrent queue implementations☆291Updated 5 years ago