共享内存并行子图枚举
Shared Memory Parallel Subgraph Enumeration
摘要:
子图枚举问题要求我们找到目标图中与给定模式图同构的所有子图。确定是否存在一个这样的同构子图是NP-完全的,因此找到所有这样的子图(如果它们存在)是一项耗时的任务。子图枚举在许多领域都有应用,包括生物化学和社交网络,有趣的是,解决生化输入问题的最快算法是顺序的。由于它们依赖于深度优先的树遍历,因此高效的并行化远非微不足道。然而,由于重要的应用程序产生的数据集越来越困难,并行似乎是有益的。因此,我们在这里提出了Bonnici等人[BMC Bioinformatics,2013]的最先进的子图枚举算法RI和RI-DS(用于密集图的RI变体)的共享内存并行化。我们的策略使用工作窃取,我们的实现在现实世界的生化数据上显示出显着的加速-尽管数据访问模式非常不规则。我们还通过更好地修剪搜索空间来改进RI-DS;与已经高度调优的RI-DS相比,这进一步改善了经验运行时间。
英文摘要:
The subgraph enumeration problem asks us to find all subgraphs of a target graph that are isomorphic to a given pattern graph. Determining whether even one such isomorphic subgraph exists is NP-complete---and therefore finding all such subgraphs (if they exist) is a time-consuming task. Subgraph enumeration has applications in many fields, including biochemistry and social networks, and interestingly the fastest algorithms for solving the problem for biochemical inputs are sequential. Since they depend on depth-first tree traversal, an efficient parallelization is far from trivial. Nevertheless, since important applications produce data sets with increasing difficulty, parallelism seems beneficial. We thus present here a shared-memory parallelization of the state-of-the-art subgraph enumeration algorithms RI and RI-DS (a variant of RI for dense graphs) by Bonnici et al. [BMC Bioinformatics, 2013]. Our strategy uses work stealing and our implementation demonstrates a significant speedup on real-world biochemical data---despite a highly irregular data access pattern. We also improve RI-DS by pruning the search space better; this further improves the empirical running times compared to the already highly tuned RI-DS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。