tudordavid / libslock
Cross-platform atomic operations and lock algorithm library
☆97Updated 6 years ago
Alternatives and similar repositories for libslock:
Users that are interested in libslock are comparing it to the libraries listed below
- QSBR and EBR library☆119Updated 5 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆86Updated 3 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆78Updated 9 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆179Updated 7 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Our open source benchmarks and code samples☆190Updated last week
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- C11 Lock-free Stack☆181Updated 11 months ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 13 years ago
- Benchmark of common hash functions☆36Updated 5 years ago
- The world's first Web-scale memory allocator☆106Updated 6 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆139Updated last year
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆39Updated 10 months ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Concurrent trie-hash map library☆91Updated last year
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- COW b-trees☆100Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Buffer based LRU cache☆39Updated 2 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆45Updated 6 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago