Hybrid methods for Parallel Betweenness Centrality on the GPU
☆24Dec 20, 2018Updated 7 years ago
Alternatives and similar repositories for hybrid_BC
Users that are interested in hybrid_BC are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- SIMD-X: Programming and Processing of Graph Algorithms on GPUs [USENIX ATC '19]☆23Jun 14, 2020Updated 6 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…☆36May 29, 2021Updated 5 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Mar 1, 2018Updated 8 years ago
- Triangle Counting for the GPU using CUDA.☆14Nov 5, 2015Updated 10 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆33May 20, 2017Updated 9 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 11 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆53Nov 17, 2015Updated 10 years ago
- CUDA CLion starter project template, with simple vector addition code.☆26Jun 20, 2018Updated 8 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Apr 23, 2020Updated 6 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆32Jan 23, 2019Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Dec 16, 2019Updated 6 years ago
- ☆13Sep 8, 2021Updated 5 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆63Oct 17, 2020Updated 5 years ago
- Medusa: Accelerating Serverless LLM Inference with Materialization [ASPLOS'25]☆12Nov 8, 2024Updated last year
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- ☆33Oct 28, 2020Updated 5 years ago
- Anonymous Chatting Website implemented by WebSocket(匿名在线聊天交友网站)☆16Sep 17, 2015Updated 11 years ago
- ☆11Nov 14, 2023Updated 2 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Oct 25, 2018Updated 7 years ago
- CK workflow, portable packages and other artifacts for the ReQuEST-ASPLOS'18 submission:☆11Jan 16, 2019Updated 7 years ago
- This repository contains the cuStinger data structure used for dynamic graph representation.☆20Jan 11, 2019Updated 7 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Mar 28, 2018Updated 8 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆91Nov 14, 2019Updated 6 years ago
- Mimir is a new implementation of MapReduce over MPI. Mimir inherits the core principles of existing MapReduce frameworks, such as MR-MPI,…☆21Nov 12, 2018Updated 7 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Validated Collective Knowledge workflows and results from the 1st ACM ReQuEST tournament on co-design of Pareto-efficient SW/HW stack for…☆13Oct 16, 2018Updated 7 years ago
- Implementation of a Tensorflow XLA rematerialization pass☆15Dec 20, 2019Updated 6 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Nov 24, 2018Updated 7 years ago
- ibmgraphblas☆29Oct 15, 2018Updated 7 years ago
- CK workflow, portable packages and other artifacts for the ReQuEST-ASPLOS'18 submission:☆15Oct 8, 2019Updated 6 years ago
- Maximum clique computation over large sparse graphs☆24Mar 19, 2022Updated 4 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆27Sep 22, 2015Updated 10 years ago
- Efficient Scientific Computing in Julia -- Workshop OIST 2019☆10Jul 19, 2019Updated 7 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆21Mar 3, 2020Updated 6 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆28Feb 14, 2026Updated 7 months ago
- sources and generated static pages for☆13Updated this week
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Jun 22, 2018Updated 8 years ago
- Transforming Graphs for Efficient Irregular Graph Processing on GPUs☆51Nov 15, 2022Updated 3 years ago
- ☆10Jul 31, 2019Updated 7 years ago
- ☆17Nov 13, 2019Updated 6 years ago
- A warp-oriented dynamic hash table for GPUs☆77Jan 19, 2024Updated 2 years ago