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☆121Updated 5 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆87Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- C11 Lock-free Stack☆183Updated last year
- COW b-trees☆102Updated 7 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 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
- A User Space Threading Library Supporting Multi-Core Systems☆140Updated last year
- Our open source benchmarks and code samples☆192Updated 2 weeks ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- The world's first Web-scale memory allocator☆108Updated 7 years ago
- A benchmark framework for concurrent queue implementations☆291Updated 5 years ago
- Concurrent trie-hash map library☆92Updated last year
- LSM-trie☆114Updated 4 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 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
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆78Updated 9 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Malloc replacement with support for shared and persistent memory allocation☆33Updated 11 years ago
- C port of the HdrHistogram☆251Updated 8 months ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- A simple, reference implementation of a B^e-tree☆155Updated 6 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago