Alternatives and similar repositories for libslock

Users that are interested in libslock are comparing it to the libraries listed below

• rmind / libqsbr
  QSBR and EBR library
  ☆125Updated 5 years ago
• LPD-EPFL / ASCYLIB
  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
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• brianwatling / libfiber
  A User Space Threading Library Supporting Multi-Core Systems
  ☆141Updated 2 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆183Updated last year
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆88Updated 3 years ago
• ohad-rodeh / bt
  COW b-trees
  ☆103Updated 7 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆193Updated 2 months ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• laysakura / Lock-free_work-stealing_deque_in_C
  Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."
  ☆19Updated 14 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• chaoran / fast-wait-free-queue
  A benchmark framework for concurrent queue implementations
  ☆293Updated 5 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆108Updated 7 years ago
• danluu / setjmp-longjmp-ucontext-snippets
  Implementing coroutines, channels, message passing, etc.
  ☆133Updated 3 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆209Updated 9 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆24Updated 10 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• kuszmaul / SuperMalloc
  A Super Fast Multithreaded malloc() for 64-bit Machines
  ☆292Updated 5 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆80Updated 9 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago