Alternatives and similar repositories for DRAMHiT

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

• splatlab / iceberghashtable
  ☆66Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆67Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆49Updated last year
• 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
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated 2 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆82Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 years ago
• lemire / batched_random
  Batched random number generation
  ☆18Updated 4 months ago
• moon-chilled / fancy-memset
  small, fast memset based on microsoft's design
  ☆13Updated 3 years ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆76Updated 3 years ago
• DolevAdas / Jiffy
  ☆45Updated 5 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆43Updated last year
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆125Updated 3 weeks ago
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆23Updated last year
• mattgodbolt / correct-by-construction
  Correct by Construction : a presentation given at C++ on Sea 2020
  ☆22Updated 5 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆56Updated 3 years ago
• espindola / cthulhu
  ☆12Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆98Updated 3 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• google-research / automemcpy
  ☆22Updated 3 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆17Updated 3 months ago
• celtera / ahsohtoa
  Structure-of-array synthesis in C++20
  ☆80Updated 3 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆23Updated 4 years ago