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☆135Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 8 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 12 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- C11 Lock-free Stack☆184Updated last year
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago
- Our open source benchmarks and code samples☆193Updated 3 months ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆90Updated 4 years ago
- The world's first Web-scale memory allocator☆110Updated 7 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- COW b-trees☆110Updated 8 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 7 years ago
- A benchmark framework for concurrent queue implementations☆297Updated 5 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆80Updated 10 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Updated 3 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆76Updated 6 years ago
- LSM-trie☆114Updated 4 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 10 years ago
- Latency benchmarks of Unix IPC mechanisms☆101Updated 4 months ago
- Implementing coroutines, channels, message passing, etc.☆134Updated 4 years ago
- A Super Fast Multithreaded malloc() for 64-bit Machines☆293Updated 6 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆48Updated 12 years ago
- NVM key-value store API lIbrary repository.☆90Updated 11 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