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
  ☆119Updated 5 years ago
• 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.
  ☆87Updated 3 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 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…
  ☆179Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆22Updated 9 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆189Updated this week
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆106Updated 6 years ago
• brianwatling / libfiber
  A User Space Threading Library Supporting Multi-Core Systems
  ☆139Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 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 13 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆139Updated 5 years ago
• dexter0 / prs
  Portable Runtime System
  ☆24Updated 8 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• ChrisDodd / shm_malloc
  Malloc replacement with support for shared and persistent memory allocation
  ☆33Updated 10 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆213Updated last year
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆77Updated 9 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆181Updated 10 months ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 years ago
• mintomic / samples
  [deprecated] Data structures and sample applications using Mintomic
  ☆93Updated 9 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 10 years ago
• mpictor / judy-template
  An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …
  ☆42Updated 10 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆35Updated 5 years ago