Alternatives and similar repositories for DRAMHiT:

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

• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆68Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆34Updated 11 months ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• boostorg / boost_unordered_benchmarks
  ☆20Updated 6 months ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆77Updated last year
• espindola / cthulhu
  ☆12Updated last year
• splatlab / iceberghashtable
  ☆60Updated 6 months ago
• lemire / batched_random
  Batched random number generation
  ☆17Updated last week
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆56Updated last year
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆105Updated 9 months ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆20Updated 3 years ago
• markwaterman / MutexShootout
  A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.
  ☆36Updated 10 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 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
  ☆25Updated 2 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆30Updated 6 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆64Updated last year
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆43Updated 2 weeks ago
• easyaspi314 / xxhash-clean
  xxHash Cleaner C Reference Implementation
  ☆44Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• fix8mt / fiber
  C++20 fiber implementation with similar interface to std::thread, header-only / x86_64 / Linux only / stackful / built-in scheduler / thr…
  ☆27Updated 7 months ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 4 months ago
• BenjaminNavarro / lvc
  Collection of C++ containers extracted from LLVM
  ☆26Updated 3 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago