tudordavid / libslockLinks
Cross-platform atomic operations and lock algorithm library
☆100Updated 7 years ago
Alternatives and similar repositories for libslock
Users that are interested in libslock are comparing it to the libraries listed below
Sorting:
- QSBR and EBR library☆133Updated 5 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆181Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- C11 Lock-free Stack☆184Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- Our open source benchmarks and code samples☆193Updated last month
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆90Updated 3 years ago
- COW b-trees☆108Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆143Updated 6 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 12 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆80Updated 9 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago
- A benchmark framework for concurrent queue implementations☆294Updated 5 years ago
- A Super Fast Multithreaded malloc() for 64-bit Machines☆292Updated 6 years ago
- Concurrent trie-hash map library☆93Updated 2 years ago
- Lock-free multithreaded memory allocation☆110Updated 8 years ago
- The world's first Web-scale memory allocator☆109Updated 7 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 4 years ago
- Lightweight locality-aware user-level threading runtime.☆198Updated 2 weeks ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 14 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 10 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- C port of the HdrHistogram☆260Updated 3 months ago
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 4 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago