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
  ☆116Updated 2 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆55Updated 2 years 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…
  ☆109Updated 5 months ago
• marvinwilliams / multiqueue
  ☆17Updated 2 months ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆30Updated 6 years ago
• GraphBLAS / rgri
  Reference implementation of the draft C++ GraphBLAS specification.
  ☆33Updated 3 months ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆133Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• alpaka-group / mallocMC
  mallocMC: Memory Allocator for Many Core Architectures
  ☆55Updated 3 weeks ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 7 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
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆73Updated last year
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 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
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• PASSIONLab / CombBLAS
  The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …
  ☆75Updated this week
• canonizer / halloc
  A fast and highly scalable GPU dynamic memory allocator
  ☆104Updated 10 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆80Updated last year