tudordavid / libslockLinks
Cross-platform atomic operations and lock algorithm library
☆99Updated 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
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 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
- Lock-free multithreaded memory allocation☆110Updated 8 years ago
- Our open source benchmarks and code samples☆193Updated 2 weeks ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆90Updated 3 years ago
- High-performance multicore-scalable data structures and benchmarks☆143Updated 6 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago
- C11 Lock-free Stack☆184Updated last year
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- LSM-trie☆114Updated 4 years ago
- COW b-trees☆107Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 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
- A benchmark framework for concurrent queue implementations☆293Updated 5 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Concurrent trie-hash map library☆92Updated 2 years 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
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆79Updated 7 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆158Updated 6 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- The world's first Web-scale memory allocator☆109Updated 7 years ago
- Lightweight locality-aware user-level threading runtime.☆197Updated last month
- Lock-free allocator as described by Maged M. Michael, 2004☆47Updated 12 years ago