Alternatives and similar repositories for rpmalloc-benchmark

Users that are interested in rpmalloc-benchmark are comparing it to the libraries listed below

• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• EmuraDaisuke / MemoryAllocator.KanameShiki
  Fast multi-threaded memory allocator
  ☆79Updated 6 years ago
• rmind / tlsf
  TLSF: two-level segregated fit O(1) allocator
  ☆82Updated 3 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
  ☆46Updated 6 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆140Updated 2 months ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆42Updated last year
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆43Updated 5 years ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆48Updated 10 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 5 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 8 years ago
• WojciechMula / simd-string
  SIMD (SSE) string functions
  ☆103Updated 8 years ago
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆46Updated last year
• piperchester / cpp-btree
  Optimized for systems that read and write large blobs.
  ☆12Updated 10 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆49Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆48Updated 12 years ago
• DolevAdas / Jiffy
  ☆45Updated 5 years ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆26Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆17Updated 3 months ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆17Updated 11 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆35Updated 5 years ago
• gstrauss / plasma
  portability macros for compiler and hardware micro operations
  ☆36Updated last year
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆52Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆36Updated 7 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 years ago