Alternatives and similar repositories for GpuRecSplit

Users that are interested in GpuRecSplit are comparing it to the libraries listed below

• marvinwilliams / multiqueue
  ☆17Updated 4 months ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated 3 months ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• ReStoreCpp / ReStore
  REplicated STORagE
  ☆13Updated 2 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated 3 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 3 months ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 3 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…
  ☆110Updated 6 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
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆121Updated 6 months ago
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 4 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• stanford-mast / Silo
  Multi-platform topology-aware memory management library
  ☆13Updated 5 years ago
• bemanproject / inplace_vector
  A dynamically-resizable vector with fixed capacity and embedded storage (P0843)
  ☆24Updated 2 weeks ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 6 months ago
• kamping-site / kamping
  KaMPIng: (Near) zero-overhead MPI wrapper for modern C++
  ☆51Updated last month
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆31Updated 3 months ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• jmuehlig / perf-cpp
  Lightweight recording and sampling of performance counters for specific code segments directly from your C++ application.
  ☆124Updated this week
• fix8mt / fiber
  C++20 fiber implementation with similar interface to std::thread, header-only / x86_64 / Linux only / stackful / built-in scheduler / thr…
  ☆28Updated 9 months ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated 2 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆43Updated this week
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆45Updated last month
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆25Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• google / hashtable-benchmarks
  ☆107Updated last year