pmntang / SIMDGiraffe

Related projects ⓘ

Alternatives and complementary repositories for SIMDGiraffe

• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆49Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆47Updated 3 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆60Updated 9 months ago
• google-research / automemcpy
  ☆21Updated 2 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆41Updated last week
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• lemire / MemoryLanes
  iOS app to test memory-level parallelism
  ☆20Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆56Updated 5 years 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 8 months ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆95Updated 3 months ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆44Updated 3 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 6 years ago
• mars-research / DRAMHiT
  ☆28Updated 3 weeks ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆65Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 7 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 4 years ago
• goldsteinn / SIMD-sorting-network
  SIMD sorting network generator and very basic tester
  ☆16Updated 2 years ago
• qlibs / swar
  C++20 SIMD Within A Register library
  ☆25Updated 3 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆38Updated 4 years ago