SubGraph2Vec: 高度向量化的类树子图计数
SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting
AI总结:
针对复杂子图计数扩展性差的问题,提出向量化算法Subgraph2Vec,通过优化邻居遍历和线性代数核实现,性能较最优方案最高提升660倍,支持分布式扩展与多硬件平台。
摘要:
子图计数旨在统计给定网络G(V, E)中模板T的出现次数,是一种强大的图分析工具,已在多个领域得到实际应用。子图计数问题的扩展受内存限制,且具有指数级复杂度,计算难度高。尽管三角计数、PageRank等若干图问题已有可扩展的并行算法,但复杂子图计数的相关算法并不常见。本文针对这一挑战,研究连通无环图即树的计数问题。我们提出了一种名为Subgraph2Vec的新型向量化子图计数算法,并实现了共享内存和分布式两种版本:1)通过最小化邻居遍历降低算法复杂度;2)基于线性代数核实现高度向量化,显著提升性能与硬件利用率;3)Subgraph2Vec的整体性能较现有最优工作提升数个数量级,单节点上最高可达660倍;4)分布式模式下的Subgraph2Vec可将模板规模扩展至20,且保持良好的强可扩展性;5)支持在CPU和GPU上移植运行。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。