Alternatives and similar repositories for SSMalloc:

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

• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆189Updated last week
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆97Updated 6 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆45Updated 11 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆63Updated last year
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆118Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• cameron314 / microbench
  A lightweight (3 file, single function) library for running micro-benchmarks on C++ code
  ☆79Updated 9 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• dcdillon / cpuaff
  C++ interface to CPU affinity management
  ☆30Updated 6 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• samanbarghi / MPSCQ
  An intrusive lock-free multiple-producer, single-consumer queue in C++
  ☆51Updated 8 years ago
• bloomberg / bde-allocator-benchmarks
  A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.
  ☆33Updated 9 years ago
• dterei / tsc
  Quick and dirty TSC access for benchmarking
  ☆30Updated 8 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆123Updated 5 years ago
• mintomic / samples
  [deprecated] Data structures and sample applications using Mintomic
  ☆93Updated 9 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆74Updated 3 years ago
• zhuoyw / CLFQ
  Implementaions of concurrent lock-free SPSC queue in c++.
  ☆17Updated 7 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 years ago
• drbobbeaty / DKit
  C++ Library of Atomic and Lockless Data Structures
  ☆38Updated 4 years ago
• preshing / ConsumeDemo
  ☆17Updated 10 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago
• node-dot-cpp / alloc-test
  Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
  ☆45Updated 6 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆39Updated 9 months ago