VSGM: View-Based GPU-Accelerated Subgraph Matching on Large Graphs
SessionGraphs and GPUs
DescriptionSubgraph matching is a fundamental building block in graph analytics. Due to its high time complexity, GPU-based solutions have been proposed for subgraph matching. Most existing GPU-based works can only cope with relatively small graphs that fit in GPU memory. To support efficient subgraph matching on large graphs, we propose a view-based method to hide communication overhead and improve GPU utilization. We develop VSGM, a subgraph matching framework that supports efficient pipelined execution and multi-GPU architecture. Extensive experimental evaluation shows that VSGM significantly outperforms the state-of-the-art solutions.
Event Type
Paper
TimeWednesday, 16 November 20223:30pm - 4pm CST
LocationC140-142
TP
Numerical Algorithms
Scientific Computing
Best Student Paper Finalists
Best Reproducibility Advancement Finalist
Recorded
Archive
view