tudordavid / libslockLinks
Cross-platform atomic operations and lock algorithm library
☆98Updated 6 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☆123Updated 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 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Our open source benchmarks and code samples☆192Updated last month
- A User Space Threading Library Supporting Multi-Core Systems☆140Updated 2 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 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
- The world's first Web-scale memory allocator☆108Updated 7 years ago
- COW b-trees☆102Updated 7 years ago
- A Super Fast Multithreaded malloc() for 64-bit Machines☆291Updated 5 years ago
- C11 Lock-free Stack☆183Updated last year
- LSM-trie☆114Updated 4 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 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
- A simple, reference implementation of a B^e-tree☆156Updated 6 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 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
- A benchmark framework for concurrent queue implementations☆291Updated 5 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 3 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Concurrent trie-hash map library☆92Updated last year
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆75Updated 6 years ago