mars-research / DRAMHiT

Related projects ⓘ

Alternatives and complementary repositories for DRAMHiT

• lemire / testingmlp
  Testing memory-level parallelism
  ☆66Updated 8 months ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆65Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆36Updated 4 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.
  ☆95Updated 3 months ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 7 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• dougallj / zlib-dougallj
  Experimental fork of zlib with performance improvements
  ☆35Updated last year
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆41Updated 2 weeks ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆28Updated 5 months ago
• intel / thin-layout-optimizer
  ☆53Updated 2 months ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆49Updated last year
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆69Updated 2 years ago
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆48Updated 4 months ago
• markwaterman / MutexShootout
  A benchmark to measure lock overhead and compare mutex performance under varying levels of contention.
  ☆33Updated 5 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆75Updated last year
• ricleite / lrmalloc
  A lock-free malloc(3) implementation
  ☆18Updated 9 months ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 years ago
• amd / aocl-compression
  A software library of lossless data compression methods tuned and optimized for AMD “Zen”-based CPUs
  ☆24Updated last week
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆56Updated 5 years ago
• mattgodbolt / correct-by-construction
  Correct by Construction : a presentation given at C++ on Sea 2020
  ☆20Updated 4 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 5 years ago
• splatlab / iceberghashtable
  ☆57Updated 3 weeks ago
• espindola / cthulhu
  ☆12Updated last year
• richgel999 / sserangecoding
  Fast vectorized (SSE 4.1) range coder for 8-bit alphabets
  ☆23Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆54Updated 11 months ago