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
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆32Updated 8 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆38Updated 6 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆215Updated 2 weeks 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
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆48Updated 4 years ago
• Liu-Cheng / graph-database-accel-survey
  ☆29Updated 8 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
• graphbig / graphBIG
  A Comprehensive Benchmark Suite for Graph Computing
  ☆70Updated 6 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…
  ☆31Updated 6 years ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆63Updated 5 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
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 4 years ago
• gunrock / mini
  mini is mini
  ☆20Updated 5 years ago
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆14Updated 4 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 4 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 10 years ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆119Updated 2 years ago
• ogreen / GpuTriangleCounting
  Triangle Counting for the GPU using CUDA.
  ☆14Updated 10 years ago
• concept-inversion / C-SAW
  A Framework for Graph Sampling and Random Walk on GPUs.
  ☆38Updated 11 months ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆90Updated 6 years ago
• desert0616 / gpma_demo
  Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs
  ☆28Updated 2 years ago
• datourat / Gorder
  ☆39Updated 6 years ago
• netsyslab / Totem
  A graph processing engine for hybrid CPU and GPU platforms
  ☆38Updated 6 years ago
• JamesTheZ / VersaPipe
  A framework for pipelined computing on GPU
  ☆30Updated 6 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆18Updated 2 years ago