arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.05039cs.DC
收藏

在GPU上加速极大双团枚举

Accelerating Maximal Biclique Enumeration on GPUs

Chou-Ying Hsieh, Chia-Ming Chang, Po-Hsiu Cheng, Sy-Yen Kuo

AI总结:

针对极大双团枚举在大规模图上计算效率低的问题,提出基于GPU优化的cuMBE算法,通过紧凑数组、混合并行、细粒度优化与工作窃取机制实现显著加速。

摘要:

极大双团枚举(Maximal Biclique Enumeration,MBE)在图论中具有关键地位,应用范围覆盖生物信息学、社交网络、推荐系统等多个领域。然而其计算复杂度为向大规模图高效扩展带来了障碍。为应对这些挑战,我们提出cuMBE,一种面向GPU优化的MBE并行算法。cuMBE采用名为紧凑数组(compact array)的独特数据结构,彻底消除了递归需求,从而显著降低了动态内存需求与计算开销。该算法采用混合并行策略,由GPU线程块处理与部分搜索过程相关的粗粒度任务;此外,我们在每个线程块内部实现了三项细粒度优化以提升性能。我们还集成了工作窃取机制,以缓解线程块间的工作负载不平衡问题。实验结果表明,在通用数据集与真实数据集上,cuMBE相较于当前最优的串行算法与基于CPU的并行算法,几何平均加速比分别达到4.02倍与4.13倍。

英文摘要:

Maximal Biclique Enumeration (MBE) holds critical importance in graph theory with applications extending across fields such as bioinformatics, social networks, and recommendation systems. However, its computational complexity presents barriers for efficiently scaling to large graphs. To address these challenges, we introduce cuMBE, a GPU-optimized parallel algorithm for MBE. Utilizing a unique data structure, called compact array, cuMBE eradicates the need for recursion, thereby significantly minimizing dynamic memory requirements and computational overhead. The algorithm utilizes a hybrid parallelism approach, in which GPU thread blocks handle coarse-grained tasks associated with part of the search process. Besides, we implement three fine-grained optimizations within each thread block to enhance performance. Further, we integrate a work-stealing mechanism to mitigate workload imbalances among thread blocks. Our experiments reveal that cuMBE achieves an geometric mean speedup of 4.02x and 4.13x compared to the state-of-the-art serial algorithm and parallel CPU-based algorithm on both common and real-world datasets, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑