Alternatives and similar repositories for alloc-test

Users that are interested in alloc-test are comparing it to the libraries listed below

• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆65Updated last year
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• rmind / tlsf
  TLSF: two-level segregated fit O(1) allocator
  ☆80Updated 2 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆78Updated 3 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆67Updated 4 years ago
• piperchester / cpp-btree
  Optimized for systems that read and write large blobs.
  ☆12Updated 10 years ago
• skarupke / mutex_benchmarks
  Code for benchmarking of mutexes to accompany a blog post of mine.
  ☆28Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• 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
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆46Updated 4 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• goldsteinn / SIMD-sorting-network
  SIMD sorting network generator and very basic tester
  ☆16Updated 3 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆60Updated 6 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• brianwatling / libfiber
  A User Space Threading Library Supporting Multi-Core Systems
  ☆140Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆45Updated 6 months ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆61Updated last year
• nemequ / LZSSE-SIMDe
  LZSSE compression codec ported to SIMDe
  ☆19Updated 5 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆45Updated 10 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 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 7 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago