Alternatives and similar repositories for parallel-string-sorting

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

• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 3 months ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years 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
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆47Updated 6 years ago
• andralex / MedianOfNinthers
  ☆49Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆32Updated 5 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• canonizer / halloc
  A fast and highly scalable GPU dynamic memory allocator
  ☆104Updated 10 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆90Updated 7 years ago
• Manu343726 / Polyop
  Overridable universal operator overloading for C++14
  ☆20Updated 10 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 3 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• fjtapia / sort_parallel
  ☆13Updated last month
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• ogiroux / freestanding
  ☆70Updated 5 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year