Alternatives and similar repositories for parallel-sort:

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

• Airtnp / Sparkpp
  A na(t)ive proof-of-concept implementation of Apache Spark in C++.
  ☆26Updated 5 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆54Updated 2 years ago
• howardlau1999 / rdmapp
  C++ interfaces for RDMA access
  ☆64Updated last week
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆71Updated 9 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 10 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆108Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 8 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆47Updated 5 months ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated last year
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆45Updated 2 months ago
• chloro-pn / tunnel
  Tunnel is a Pipeline Execution Engine based on C++20 coroutine
  ☆27Updated last year
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆111Updated last month
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆36Updated 6 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆35Updated 5 years ago
• r-lyeh-archived / trie
  Trie is a lightweight and simple autocompletion data structure written in C++11.
  ☆44Updated 9 years ago
• alexandervanrenen / pmembench
  Low level algorithms for persistent memory.
  ☆16Updated 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
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 7 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• MengRao / str
  A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching
  ☆127Updated 3 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆27Updated 9 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆212Updated last year
• greensky00 / latency-collector
  Latency collector as an embedded library for C++
  ☆13Updated 5 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆173Updated 8 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆76Updated last year
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆25Updated 10 years ago