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
  ☆26Updated 8 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 10 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆214Updated 3 months 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
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆47Updated 4 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆38Updated 6 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆32Updated 8 years ago
• graphbig / graphBIG
  A Comprehensive Benchmark Suite for Graph Computing
  ☆71Updated 6 years ago
• Liu-Cheng / graph-database-accel-survey
  ☆29Updated 8 years ago
• 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
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆90Updated 6 years ago
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 7 years ago
• GPUPeople / GPUMemManSurvey
  Evaluating different memory managers for dynamic GPU memory
  ☆26Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated 9 months ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆18Updated 2 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆28Updated 2 years ago
• masabahmad / CRONO
  A Shared Memory Multithreaded Graph Benchmark Suite for Multicores
  ☆36Updated 6 months ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆30Updated 6 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆33Updated last year
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 7 years ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆118Updated 2 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 4 years ago
• farkhor / WS-VR
  A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.
  ☆12Updated 8 years ago
• datourat / Gorder
  ☆39Updated 6 years ago
• HPCGraphAnalysis / PuLP
  ☆26Updated 3 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆53Updated 10 years ago
• xiechenny / powerswitch
  PowerSwitch: a adaptive mode switch engine for distributed parrallel graph computation
  ☆16Updated 11 years ago