arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.00963cs.DCcs.DScs.SI
收藏

多GPU系统上可扩展介数中心性计算的算法与启发式

Algorithms and Heuristics for Scalable Betweenness Centrality Computation on Multi-GPU Systems

Flavio Vella, Giancarlo Carbone, Massimo Bernaschi

摘要:

介数中心性(BC)作为图中顶点影响力的度量标准正在稳步增长。一个顶点的BC得分与通过它的所有最短路径对的数量成正比,然而,对于大规模图来说,完全精确的BC计算是一个巨大的挑战,需要高性能的计算技术才能在合理的时间内给出结果。我们的方法结合了二维(2-D)分解的图形和多层次的并行性与一个合适的数据线程映射,克服了大多数的困难所造成的GPU上的计算不规则。此外,我们提出了新的算法,利用图的拓扑信息,以减少BC计算的时间和空间要求。合成和真实世界的图形上的实验结果表明,所提出的技术允许BC计算的图形是太大,以适应在一个单一的计算节点的内存中,随着显着减少的计算时间。

英文摘要:

Betweenness Centrality (BC) is steadily growing in popularity as a metrics of the influence of a vertex in a graph. The BC score of a vertex is proportional to the number of all-pairs-shortest-paths passing through it. However, complete and exact BC computation for a large-scale graph is an extraordinary challenge that requires high performance computing techniques to provide results in a reasonable amount of time. Our approach combines bi-dimensional (2-D) decomposition of the graph and multi-level parallelism together with a suitable data-thread mapping that overcomes most of the difficulties caused by the irregularity of the computation on GPUs. Furthermore, we propose novel heuristics which exploit the topology information of the graph in order to reduce time and space requirements of BC computation. Experimental results on synthetic and real-world graphs show that the proposed techniques allow the BC computation of graphs which are too large to fit in the memory of a single computational node along with a significant reduction of the computing time.

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

↑