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
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆86Updated last week
• jk-jeon / Grisu-Exact
  Reference implementation of Grisu-Exact in C++
  ☆69Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆48Updated 10 years 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…
  ☆52Updated 4 years ago
• twiggler / slotmap
  Slotmap is a sequence container with weak reference keys written in C++17.
  ☆39Updated last year
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 7 years ago
• aklomp / missing-sse-intrinsics
  Polyfill some holes in the SSE intrinsics set
  ☆50Updated 3 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆56Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆37Updated 2 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆122Updated 5 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆67Updated 2 months ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆140Updated 2 months ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆42Updated last year
• node-dot-cpp / alloc-test
  Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical
  ☆46Updated 6 years ago
• melowntech / half
  Half precision floating point C++ library (imported from sourceforge upstream).
  ☆35Updated 8 years ago
• gnzlbg / scattered
  C++ Scattered Containers
  ☆67Updated 8 years ago
• sid1607 / avx2-merge-sort
  ☆17Updated 9 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated 2 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆74Updated 4 years ago
• larkmjc / cpphashmap
  fast open addressing hash table
  ☆42Updated 2 months ago