Alternatives and similar repositories for pargeo

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

• ParAlg / ParGeo
  ☆47Updated 2 years ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆19Updated last year
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆66Updated 2 months ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• horizon-research / rtnn
  ☆66Updated 2 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆48Updated 8 months ago
• wangyiqiu / dbscan
  Further development has been moved to a new repository https://github.com/wangyiqiu/dbscan-python
  ☆18Updated 2 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆73Updated last year
• 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
• gunrock / essentials
  ❤️ CUDA/C++ GPU graph analytics simplified.
  ☆31Updated 2 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆56Updated 3 years ago
• GPUPeople / ACSpGEMM
  Repository holding the code base to AC-SpGEMM : "Adaptive Sparse Matrix-Matrix Multiplication on the GPU"
  ☆28Updated 4 years ago
• wheatman / Packed-Memory-Array
  ☆18Updated 6 months ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 8 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• txstc55 / EGGS
  EGGS, a method to speed up sparse matrix operations when the same sparsity is used for multiple times. This repo contains examples that s…
  ☆25Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆26Updated 2 years ago
• asherliu / simd-x
  SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]
  ☆20Updated 5 years ago
• owensgroup / SlabAlloc
  A dynamic GPU memory allocator, suitable for warp synchronized scenarios.
  ☆11Updated 5 years ago
• ScottKolo / Mongoose
  Graph Coarsening and Partitioning Library
  ☆32Updated 5 years ago
• GPUPeople / GPUMemManSurvey
  Evaluating different memory managers for dynamic GPU memory
  ☆25Updated 4 years ago
• stijnh / HyGraph
  High-performance graph processing on hybrid CPU-GPU platforms by using dynamic load-balancing
  ☆12Updated 8 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆79Updated 6 years ago
• vazois / TopK
  TopK Algorithms Benchmark
  ☆10Updated 5 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆35Updated 5 years ago
• owensgroup / ATOS
  Multi-GPU dynamic scheduler using PGAS style cross-GPU communication
  ☆27Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆27Updated 2 years ago
• apc-llc / whippletree
  Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU
  ☆21Updated 9 years ago
• gcoe-dresden / cuda-gpu-tlb
  TLB Benchmarks
  ☆34Updated 7 years ago