Alternatives and similar repositories for SIMDGiraffe

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

• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 4 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆50Updated 4 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• lemire / batched_random
  Batched random number generation
  ☆17Updated last month
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 5 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆43Updated 2 weeks ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆105Updated 10 months ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆66Updated 4 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
• computersforpeace / model-checker
  CDSChecker: A Model Checker for C11 and C++11 Atomics
  ☆29Updated 11 years ago
• oschonrock / binfuse
  c++ library for binary fuse filters, including a sharded filter
  ☆88Updated 4 months ago
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆36Updated last year
• google / hashtable-benchmarks
  ☆106Updated last year
• lemire / testingmlp
  Testing memory-level parallelism
  ☆68Updated last year
• intel / ittapi
  Intel® Instrumentation and Tracing Technology (ITT) and Just-In-Time (JIT) APIs
  ☆113Updated last week
• amdn / itoa
  World's fastest integer to ASCII conversion, C++14 template meta-programming implementation, any size integer 8,16,32,64-bit, signed or u…
  ☆27Updated 8 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆66Updated 3 years ago
• sillycross / WasmNow
  Fast WebAssembly Baseline Compiler
  ☆56Updated 2 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 7 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆34Updated last year
• goodell / cppmem
  totally unofficial git repo containing sources for the CppMem tool available at http://svr-pes20-cppmem.cl.cam.ac.uk/cppmem/help.html and…
  ☆26Updated 12 years ago