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
  ☆119Updated 6 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…
  ☆113Updated 9 months ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆57Updated 3 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated 2 months 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
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆47Updated 4 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆63Updated 4 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆51Updated 11 months ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated 2 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆88Updated 5 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆382Updated 3 weeks ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆28Updated 6 months ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 10 years ago
• canonizer / halloc
  A fast and highly scalable GPU dynamic memory allocator
  ☆109Updated 10 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• alpaka-group / mallocMC
  mallocMC: Memory Allocator for Many Core Architectures
  ☆58Updated 5 months ago
• marvinwilliams / multiqueue
  ☆17Updated 6 months ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• stijnh / HyGraph
  High-performance graph processing on hybrid CPU-GPU platforms by using dynamic load-balancing
  ☆12Updated 9 years ago
• sid1607 / avx2-merge-sort
  ☆17Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• gunrock / graphblast
  High-Performance Linear Algebra-based Graph Primitives on GPUs
  ☆230Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• lcchen008 / irreg-simd
  Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"
  ☆11Updated 9 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆82Updated 3 years ago