Alternatives and similar repositories for sorting-network

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

• emilk / ram_bench
  A benchmark for random memory accesses
  ☆121Updated 2 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆110Updated last year
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆122Updated 6 months ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆79Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆155Updated 3 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆44Updated 2 months ago
• bertdobbelaere / SorterHunter
  An evolutionary approach to find small and low latency sorting networks
  ☆66Updated 3 months ago
• PeterLuschny / Fast-Factorial-Functions
  Swing, divide and conquer the factorial!
  ☆81Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆48Updated 6 years ago
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆36Updated last year
• weissan / BlockQuicksort
  ☆35Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 5 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…
  ☆48Updated 4 years ago
• BuildIt-lang / buildit
  Online demo without installing at - https://buildit.so/tryit
  ☆178Updated last month
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆54Updated 11 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated 11 months ago
• mis-wut / feathergpu
  ☆15Updated 8 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• conp-solutions / mergesat
  configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…
  ☆41Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆46Updated last month
• andralex / MedianOfNinthers
  ☆49Updated 5 years ago
• google / hashtable-benchmarks
  ☆108Updated last year
• llvm-mirror / polly
  Mirror kept for legacy. Moved to https://github.com/llvm/llvm-project
  ☆88Updated 5 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆37Updated last year