Efficient Strategies for Graph Pattern Mining Algorithms on GPUs
Samuel Ferraz, Vinicius Dias, Carlos H. C. Teixeira, George Teodoro,, Wagner Meira Jr

TL;DR
This paper introduces novel GPU-based strategies for efficient graph pattern mining, significantly accelerating subgraph enumeration and enabling larger subgraph extraction compared to existing systems.
Contribution
It proposes a warp-centric, depth-first search approach with load balancing for GPU, implemented in the DuMato system, improving performance and scalability.
Findings
DuMato is often an order of magnitude faster than existing systems.
It can mine larger subgraphs, up to 12 vertices.
The strategies improve GPU utilization and reduce divergence.
Abstract
Graph Pattern Mining (GPM) is an important, rapidly evolving, and computation demanding area. GPM computation relies on subgraph enumeration, which consists in extracting subgraphs that match a given property from an input graph. Graphics Processing Units (GPUs) have been an effective platform to accelerate applications in many areas. However, the irregularity of subgraph enumeration makes it challenging for efficient execution on GPU due to typical uncoalesced memory access, divergence, and load imbalance. Unfortunately, these aspects have not been fully addressed in previous work. Thus, this work proposes novel strategies to design and implement subgraph enumeration efficiently on GPU. We support a depth-first search style search (DFS-wide) that maximizes memory performance while providing enough parallelism to be exploited by the GPU, along with a warp-centric design that minimizes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
