Alternatives and similar repositories for SortingNetworks

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

• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 4 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆68Updated 4 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆59Updated 6 years ago
• google / hashtable-benchmarks
  ☆108Updated last year
• WojciechMula / base64simd
  Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)
  ☆167Updated 5 months ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆61Updated last year
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆155Updated 3 years ago
• jdmccalpin / low-overhead-timers
  Very low-overhead timer/counter interfaces for C on Intel 64 processors.
  ☆135Updated 5 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 4 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆68Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆134Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• rmind / tlsf
  TLSF: two-level segregated fit O(1) allocator
  ☆80Updated 2 years ago
• cksystemsgroup / scalloc
  A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator
  ☆163Updated last month
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 8 years ago