Alternatives and similar repositories for parallel-inplace-radixsort

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

• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 5 months ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆112Updated 8 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 6 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated 3 weeks ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆136Updated 2 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆57Updated 3 years ago
• wheatman / Packed-Memory-Array
  ☆24Updated 8 months ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆87Updated 5 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆20Updated 12 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆49Updated 10 months ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated 2 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• sid1607 / avx2-merge-sort
  ☆17Updated 8 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated 11 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆21Updated 4 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆371Updated 3 months ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆24Updated 2 weeks ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago
• marvinwilliams / multiqueue
  ☆17Updated 5 months ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago