Alternatives and similar repositories for pargeo:

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

• ParAlg / ParGeo
  ☆46Updated 2 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• GPUPeople / GPUMemManSurvey
  Evaluating different memory managers for dynamic GPU memory
  ☆24Updated 4 years ago
• johnpzh / parallel_ANNS
  Parallel Approximate Nearest Neighbor Search
  ☆12Updated 2 years ago
• vazois / TopK
  TopK Algorithms Benchmark
  ☆10Updated 5 years ago
• wheatman / Packed-Memory-Array
  ☆16Updated 2 months ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆18Updated last year
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 3 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆29Updated 10 months ago
• wangyiqiu / hdbscan
  A Fast Parallel Algorithm for HDBSCAN* Clustering
  ☆55Updated 2 years ago
• wangyiqiu / dbscan
  Further development has been moved to a new repository https://github.com/wangyiqiu/dbscan-python
  ☆18Updated 2 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 3 months ago
• notini / csr-formatter
  C++ package to store Matrix Market (.mtx) file format sparse matrices in Compressed Row Storage (CSR) format.
  ☆13Updated 5 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆23Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• cchatzis / Nearest-Neighbour-LSH
  C++ program that, given a vectorised dataset and query set, performs locality sensitive hashing, finding either Nearest Neighbour (NN) or…
  ☆11Updated 3 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆30Updated 7 years ago
• guowentian / SubgraphMatchGPU
  ☆29Updated 4 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 4 years ago
• asherliu / simd-x
  SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]
  ☆20Updated 4 years ago
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆10Updated 3 years ago
• ScottKolo / Mongoose
  Graph Coarsening and Partitioning Library
  ☆32Updated 5 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 10 years ago
• marvinwilliams / multiqueue
  ☆17Updated 3 weeks ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 3 months ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆56Updated 2 years ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆61Updated 4 years ago
• horizon-research / rtnn
  ☆64Updated last year
• dholzmueller / sfcpp
  A library with space-filling curve algorithms (analysis, neighbor-finding, visualization) and other utilities (math, geometry, image proc…
  ☆24Updated 7 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆74Updated last year