Alternatives and similar repositories for TopK

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

• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆57Updated 3 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆74Updated last year
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 4 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆49Updated 8 months ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 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
• bcaine / nn_cpp
  A minimalistic header only C++11 Neural Network library based on Eigen::Tensor
  ☆20Updated 7 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated 7 months ago
• asherliu / simd-x
  SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]
  ☆21Updated 5 years ago
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago
• dian-lun-lin / SNIG
  SNIG: Accelerated Large Sparse Neural Network Inference using Task Graph Parallelism
  ☆34Updated 3 years ago
• jjiantong / FastPGM
  Fast Parallel Probabilistic Graphical Model Learning and Inference [IPDPS'22, PPoPP'23, USENIX ATC'24]
  ☆56Updated 5 months ago
• SEP-Graph / sep-graph
  This is the repo of "SEP-Graph: Finding Shortest Execution Paths for Graph Processing under a Hybrid Framework on GPU"
  ☆13Updated 6 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆29Updated last year
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated 5 months ago
• amazon-science / FeatGraph
  ☆70Updated 4 years ago
• AMDResearch / DAGEE
  Directed Acyclic Graph Execution Engine (DAGEE) is a C++ library that enables programmers to express computation and data movement, as ta…
  ☆46Updated 3 years ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆19Updated 2 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 8 years ago
• AutomataLab / Subway
  Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
  ☆55Updated 2 years ago
• gcoe-dresden / cuda-gpu-tlb
  TLB Benchmarks
  ☆34Updated 7 years ago
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆70Updated 2 weeks ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆162Updated 5 months ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 8 months ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆62Updated 4 years ago
• sleeepyjack / warpcore
  A Library for fast Hash Tables on GPUs
  ☆125Updated 3 years ago
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆12Updated 4 years ago
• wheatman / Packed-Memory-Array
  ☆20Updated 7 months ago
• johnpzh / parallel_ANNS
  Parallel Approximate Nearest Neighbor Search
  ☆13Updated 2 years ago