Alternatives and similar repositories for parallel-inplace-radixsort

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

• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆110Updated 5 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 3 months ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆56Updated 2 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated last year
• marvinwilliams / multiqueue
  ☆17Updated 3 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• alpaka-group / mallocMC
  mallocMC: Memory Allocator for Many Core Architectures
  ☆56Updated last month
• 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
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• rstream-system / RStream
  ☆25Updated 2 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆48Updated 8 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• 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
• 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++
  ☆20Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆61Updated 4 years 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
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆133Updated 2 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago