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 10 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆41Updated this week
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• lemire / batched_random
  Batched random number generation
  ☆15Updated last month
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• JustKshitijD / Harmonia_for_B_plus_trees
  Harmonia is an algorithm that allows for the implementation of operations on B+ trees using parallelization. As a part of my GPU project,…
  ☆29Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆98Updated 5 months 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
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• intel / thin-layout-optimizer
  ☆55Updated 4 months ago
• markwaterman / MutexShootout
  A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.
  ☆33Updated 7 months ago
• splatlab / iceberghashtable
  ☆58Updated 2 months ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆50Updated 2 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆30Updated 7 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• tuhhosg / exmap
  ☆39Updated 9 months ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆42Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆37Updated 4 years 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
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• ricleite / lrmalloc
  A lock-free malloc(3) implementation
  ☆19Updated 11 months ago
• nadavrot / bistra
  Bistra is a domain-specific language designed to generate high-performance kernels (such as GEMMs, convolutions, etc). The program is des…
  ☆6Updated 10 months ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• BenjaminNavarro / lvc
  Collection of C++ containers extracted from LLVM
  ☆26Updated 3 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 5 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆76Updated last year