Alternatives and similar repositories for parallel-merge-sort:

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

• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆64Updated 9 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 5 months ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• WojciechMula / simd-heap
  ☆10Updated 2 months ago
• rigtorp / isatomic
  Test if AVX vector loads and stores are atomic
  ☆29Updated 4 years ago
• gnzlbg / nmp
  Non-blocking message passing (a C++14 MPI wrapper)
  ☆18Updated 10 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆15Updated 8 years ago
• biojppm / cmany
  Easily batch-build cmake projects!
  ☆17Updated last month
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆71Updated 4 years ago
• alpaka-group / mallocMC
  mallocMC: Memory Allocator for Many Core Architectures
  ☆55Updated last week
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆30Updated 6 years ago
• lanl / SICM
  Simplified Interface to Complex Memory
  ☆28Updated last year
• heal-research / vstat
  SIMD-enabled descriptive statistics (mean, variance, covariance, correlation)
  ☆18Updated this week
• prg-titech / ikra-cpp
  C++ Library for Object-oriented Programming with Structure of Arrays Layout
  ☆21Updated 6 years ago
• aavenel / FastMortonKeys
  Compute morton keys using a look-up table generated at compile-time.
  ☆31Updated 8 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• tpn / agner
  Collection of Agner Fog Software
  ☆38Updated 6 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆55Updated 2 years 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
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• michaelvlach / ADbHash
  Really fast C++ hash table
  ☆14Updated 7 years ago
• pdziepak / ranges-gpu
  Experimental ranges for CUDA
  ☆24Updated 6 years ago
• canonizer / halloc
  A fast and highly scalable GPU dynamic memory allocator
  ☆104Updated 10 years ago
• GPUPeople / GPUMemManSurvey
  Evaluating different memory managers for dynamic GPU memory
  ☆25Updated 4 years ago
• bloomberg / bde-allocator-benchmarks
  A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.
  ☆33Updated 9 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• r-lyeh-archived / malloc-survey
  Allocation benchmarks
  ☆30Updated 8 years ago