Alternatives and similar repositories for PKC:

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

• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆23Updated 7 years ago
• IntelligentSoftwareSystems / GaloisGPU
  LonestarGPU: Irregular algorithms parallelized for GPUs
  ☆34Updated 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…
  ☆28Updated 6 years ago
• gunrock / mini
  mini is mini
  ☆21Updated 5 years ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 7 years ago
• linhongseba / MaximumClique
  The implementation for maximum clique enumeration algorithm
  ☆11Updated 8 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 3 years ago
• chenxuhao / GraphAIBench
  A benchmark suite for Graph Machine Learning
  ☆18Updated 5 months ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated 11 months ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆12Updated 4 years ago
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago
• farkhor / WS-VR
  A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.
  ☆10Updated 8 years ago
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆61Updated 4 years ago
• dnasc / graph-processing
  This repository contains information about graph processing.
  ☆32Updated 7 months ago
• GPUPeople / faimGraph
  This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"
  ☆11Updated 3 years ago
• farkhor / CuSha
  CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.
  ☆52Updated 9 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆55Updated 2 years ago
• ogreen / GpuTriangleCounting
  Triangle Counting for the GPU using CUDA.
  ☆14Updated 9 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  Updated 3 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 4 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 3 years ago
• chenxuhao / gardenia
  GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators
  ☆30Updated 2 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• Adam27X / hybrid_BC
  Hybrid methods for Parallel Betweenness Centrality on the GPU
  ☆24Updated 6 years ago
• NVIDIA / PRBench
  A CUDA implementation of the PageRank Pipeline Benchmark
  ☆32Updated 8 years ago
• groute / groute
  Asynchronous Multi-GPU Programming Framework
  ☆45Updated 3 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆30Updated 7 months ago