Alternatives and similar repositories for PKC

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

• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆25Updated 8 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆87Updated 5 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆36Updated 5 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated 3 weeks ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 8 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 9 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 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
• graphbig / graphBIG
  A Comprehensive Benchmark Suite for Graph Computing
  ☆70Updated 6 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆46Updated 4 years ago
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 6 years ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆20Updated 2 years ago
• Liu-Cheng / graph-database-accel-survey
  ☆29Updated 8 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆74Updated last year
• farkhor / WS-VR
  A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.
  ☆11Updated 8 years ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆115Updated 2 years ago
• linhongseba / MaximumClique
  The implementation for maximum clique enumeration algorithm
  ☆11Updated 9 years ago
• Adam27X / hybrid_BC
  Hybrid methods for Parallel Betweenness Centrality on the GPU
  ☆24Updated 6 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated 7 months ago
• ogreen / GpuTriangleCounting
  Triangle Counting for the GPU using CUDA.
  ☆14Updated 9 years ago
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆13Updated 4 years ago
• wheatman / Packed-Memory-Array
  ☆24Updated 8 months ago
• chenxuhao / gardenia
  GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators
  ☆33Updated 3 years ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆63Updated 4 years ago
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• ucrparlay / Parallel-SSSP
  SPAA'21: Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
  ☆19Updated last year
• CGCL-codes / Frog
  Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…
  ☆36Updated 4 years ago
• ustcadsl / GraphWalker
  ☆19Updated 5 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆27Updated 2 years ago