Adam27X / hybrid_BC
Hybrid methods for Parallel Betweenness Centrality on the GPU
☆24Updated 6 years ago
Alternatives and similar repositories for hybrid_BC:
Users that are interested in hybrid_BC are comparing it to the libraries listed below
- This repository contains the cuStinger data structure used for dynamic graph representation.☆19Updated 6 years ago
- A graph processing engine for hybrid CPU and GPU platforms☆38Updated 6 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- ☆9Updated 6 years ago
- A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.☆10Updated 8 years ago
- ☆24Updated 2 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 7 years ago
- ☆17Updated 4 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- Hornet data structure for sparse dynamic graphs and matrices☆82Updated 5 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 3 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- LonestarGPU: Irregular algorithms parallelized for GPUs☆35Updated 5 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 9 years ago
- GraphMat graph analytics framework☆102Updated 2 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 7 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 6 years ago
- Triangle Counting for the GPU using CUDA.☆14Updated 9 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 years ago
- ☆45Updated 2 weeks ago
- Transforming Graphs for Efficient Irregular Graph Processing on GPUs☆47Updated 2 years ago
- 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
- A C++ Pregel Clone with dynamic load balancing, based on a paper "Mizan: A System for Dynamic Load Balancing in Large-scale Graph Process…☆27Updated 11 years ago
- ☆28Updated last week
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Out-of-GPU-Memory Graph Processing with Minimal Data Transfer☆53Updated 2 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated last week
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆61Updated 4 years ago