Alternatives and similar repositories for parallel-merge-sort:

Users that are interested in parallel-merge-sort are comparing it to the libraries listed below

• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆45Updated 2 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆29Updated 6 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• alpaka-group / mallocMC
  mallocMC: Memory Allocator for Many Core Architectures
  ☆53Updated this week
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆63Updated 9 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆62Updated last year
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆27Updated 4 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆54Updated 2 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 8 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 4 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 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 …
  ☆22Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• eyalroz / libgiddy
  Giddy - A lightweight GPU decompression library
  ☆42Updated 5 years ago
• DragonSpit / ParallelAlgorithms
  Parallel C++ algorithms
  ☆58Updated 8 months ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 3 years ago
• proywm / CCProf
  CCProf: Lightweight Detection of Cache Conflicts
  ☆25Updated 3 years ago
• lwu / veb-tree
  A C++ implementation of cache-oblivious Van Emde Boas search trees
  ☆19Updated 6 years ago
• darkobozidar / cpu-vs-gpu-sorting
  A comparison study between sequential sorting algorithms implemented in C++ and parallel sorting algorithms implemented in CUDA as part o…
  ☆61Updated 3 years ago