SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting

09/23/2020
by   Langshi Chen, et al.
0

Subgraph counting aims to count occurrences of a template T in a given network G(V, E). It is a powerful graph analysis tool and has found real-world applications in diverse domains. Scaling subgraph counting problems is known to be memory bounded and computationally challenging with exponential complexity. Although scalable parallel algorithms are known for several graph problems such as Triangle Counting and PageRank, this is not common for counting complex subgraphs. Here we address this challenge and study connected acyclic graphs or trees. We propose a novel vectorized subgraph counting algorithm, named Subgraph2Vec, as well as both shared memory and distributed implementations: 1) reducing algorithmic complexity by minimizing neighbor traversal; 2) achieving a highly-vectorized implementation upon linear algebra kernels to significantly improve performance and hardware utilization. 3) Subgraph2Vec improves the overall performance over the state-of-the-art work by orders of magnitude and up to 660x on a single node. 4) Subgraph2Vec in distributed mode can scale up the template size to 20 and maintain good strong scalability. 5) enabling portability to both CPU and GPU.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2019

A GraphBLAS Approach for Subgraph Counting

Subgraph counting aims to count the occurrences of a subgraph template T...
research
04/25/2018

High-Performance Massive Subgraph Counting using Pipelined Adaptive-Group Communication

Subgraph counting aims to count the number of occurrences of a subgraph ...
research
12/14/2019

A decentralized algorithm for network node counting

Node counting on a graph is subject to some fundamental theoretical limi...
research
06/08/2019

GSI: GPU-friendly Subgraph Isomorphism

Subgraph isomorphism is a well-known NP-hard problem that is widely used...
research
12/21/2021

Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations

Counting instances of specific subgraphs in a larger graph is an importa...
research
12/18/2017

Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion

Counting subgraph isomorphisms (also called motifs or graphlets) has bee...
research
09/22/2021

Intel Optane DCPMM and Serverless Computing

This report describes 1) how we use Intel's Optane DCPMM in the memory M...

Please sign up or login with your details

Forgot password? Click here to reset