Alternatives and similar repositories for GpuRecSplit

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

• marvinwilliams / multiqueue
  ☆17Updated 10 months ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated 9 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…
  ☆117Updated last year
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆14Updated 2 years ago
• ReStoreCpp / ReStore
  REplicated STORagE
  ☆13Updated 2 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆132Updated last year
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆22Updated 3 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆20Updated 3 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 9 months ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆34Updated 9 months ago
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆11Updated 3 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• jmuehlig / perf-cpp
  Lightweight recording and sampling of performance counters for specific code segments directly from your C++ application.
  ☆167Updated 3 weeks ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆47Updated last week
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆26Updated 3 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆166Updated last year
• GraphBLAS / rgri
  Reference implementation of the draft C++ GraphBLAS specification.
  ☆32Updated 11 months ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆415Updated 2 months ago
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆174Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated last year
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 4 months ago
• simd-sorting / fast-and-robust
  ☆32Updated 4 years ago
• sid1607 / avx2-merge-sort
  ☆17Updated 9 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• nitnelave / lru_cache
  A C++ implementation of a LRU cache
  ☆42Updated 5 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆87Updated 2 years ago
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆113Updated 2 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• bemanproject / inplace_vector
  A dynamically-resizable vector with fixed capacity and embedded storage (P0843)
  ☆28Updated last week