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
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated 2 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆67Updated 4 years ago
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆49Updated last year
• gerben-s / quicksort-blog-post
  ☆39Updated 4 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
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 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
• lemire / testingmlp
  Testing memory-level parallelism
  ☆82Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• espindola / cthulhu
  ☆12Updated 2 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆41Updated 5 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• lemire / batched_random
  Batched random number generation
  ☆18Updated 3 months ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆17Updated 2 months ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆56Updated 3 years ago
• gshanemiller / rdpmc
  Task: minimum complete example demonstrating programming using Intel's 'rdpmc' instruction
  ☆21Updated 2 years ago
• DolevAdas / Jiffy
  ☆45Updated 5 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆123Updated this week
• 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
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆46Updated last year
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆23Updated 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…
  ☆52Updated 4 years ago
• ricleite / lrmalloc
  A lock-free malloc(3) implementation
  ☆20Updated 6 months ago