Alternatives and similar repositories for DRAMHiT:

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

• lemire / testingmlp
  Testing memory-level parallelism
  ☆67Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆102Updated 7 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆77Updated last year
• splatlab / iceberghashtable
  ☆60Updated 4 months ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆42Updated 3 weeks ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆32Updated 9 months ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆100Updated 7 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• intel / thin-layout-optimizer
  ☆56Updated 6 months ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆30Updated 6 years ago
• lemire / batched_random
  Batched random number generation
  ☆16Updated 3 months ago
• boostorg / boost_unordered_benchmarks
  ☆18Updated 5 months ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆20Updated 3 years ago
• travisdowns / page-info
  Programatically obtain information about the pages backing a given memory region
  ☆74Updated 3 years ago
• markwaterman / MutexShootout
  A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.
  ☆35Updated 9 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 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
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• intel / QAT-ZSTD-Plugin
  ☆65Updated 6 months ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 years ago
• LLNL / umap
  User-space Page Management
  ☆108Updated 7 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago