Alternatives and similar repositories for SIMD-sorting-network

Users that are interested in SIMD-sorting-network are comparing it to the libraries listed below

• simd-sorting / fast-and-robust
  ☆32Updated 4 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆17Updated 3 months ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆122Updated 5 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 5 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆56Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated 3 weeks ago
• ConorStokes / LZSSE
  LZ77/LZSS designed for SSE based decompression
  ☆145Updated 6 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• larkmjc / cpphashmap
  fast open addressing hash table
  ☆42Updated 3 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆68Updated 2 years ago
• jk-jeon / Grisu-Exact
  Reference implementation of Grisu-Exact in C++
  ☆68Updated 5 years ago
• gnzlbg / scattered
  C++ Scattered Containers
  ☆67Updated 8 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆92Updated 2 years ago
• genericsimd / generic_simd
  Generic SIMD intrinsic to allow for portable SIMD intrinsic programming
  ☆42Updated 11 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• komrad36 / FastArrayOps
  Extremely fast x86 / AVX2 assembly implementations of common operations for linear arrays: checking whether array contains element, findi…
  ☆40Updated last month
• google / hashtable-benchmarks
  ☆113Updated 2 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆58Updated last year
• WojciechMula / man-intrinsics
  Create man pages from information used by Intel Intrinsics Guide and optionally uops.info
  ☆46Updated last year
• twiggler / slotmap
  Slotmap is a sequence container with weak reference keys written in C++17.
  ☆39Updated last year
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆52Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆38Updated 2 years ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆48Updated 10 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 8 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 7 years ago