Alternatives and similar repositories for DRAMHiT

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

• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆72Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆39Updated 4 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆65Updated last year
• lemire / batched_random
  Batched random number generation
  ☆18Updated 2 months ago
• splatlab / iceberghashtable
  ☆61Updated 8 months ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆73Updated 2 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 5 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
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆49Updated last year
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆109Updated 11 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆43Updated last month
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆99Updated 3 years ago
• espindola / cthulhu
  ☆12Updated last year
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆44Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆59Updated 6 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆35Updated last year
• intel / thin-layout-optimizer
  ☆56Updated 10 months ago
• BenjaminNavarro / lvc
  Collection of C++ containers extracted from LLVM
  ☆26Updated 4 years ago
• richgel999 / sserangecoding
  Fast vectorized (SSE 4.1) range coder for 8-bit alphabets
  ☆25Updated 2 years ago