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
  ☆135Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 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…
  ☆182Updated 7 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 12 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆184Updated last year
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆90Updated 3 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆193Updated 2 months ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• brianwatling / libfiber
  A User Space Threading Library Supporting Multi-Core Systems
  ☆141Updated 2 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆109Updated 7 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• ohad-rodeh / bt
  COW b-trees
  ☆108Updated 8 years ago
• kuszmaul / SuperMalloc
  A Super Fast Multithreaded malloc() for 64-bit Machines
  ☆293Updated 6 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 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
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆53Updated 4 years ago
• Lupus / libevfibers
  Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.
  ☆138Updated 6 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆174Updated 5 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆17Updated 11 years ago