基于NUMA延迟发送的时变图弱连通分量求解  

NUMA-based Delayed Sending Method for Weakly Connected Components of Time-evolving Graph

作　　者：梁锐杰 程永利 LIANG Rui-Jie;CHENG Yong-Li(College of Computer and Data Science/College of Software,Fuzhou University,Fuzhou 350116,China)

机构地区：[1]福州大学计算机与大数据学院/软件学院,福州350116

出　　处：《计算机系统应用》2023年第3期322-329,共8页Computer Systems & Applications

基　　金：福建省自然科学基金(2020J01493)。

摘　　要：时变图连通分量已经被广泛应用到不同场景,如交通路网建设、推荐系统的信息推送等.然而当前多数连通分量求解方法忽视了NUMA体系结构对计算效率产生的影响,即过高的远程内存访问延迟导致低下的算法执行效率.本文针对时变图的弱连通分量求解问题,提出一种基于NUMA延迟发送的时变图弱连通分量求解方法,它通过合理的数据内存布局,合理控制NUMA节点间的信息交换次数,最大限度减少远程内存访问数量,显著提高了算法执行效率.实验结果表明,该方法的性能明显优于当前流行的图处理系统Ligra和Polymer提供的方法.The weakly connected components of the time-evolving graph have been widely used in many areas, such as traffic network construction, information push of recommendation systems, etc. However, most methods for the weakly connected components ignore the impact of the non-uniform memory access(NUMA) architecture, that is, the high remote memory access delay leads to low execution efficiency. This study proposes a NUMA-based delayed sending method to find the weakly connected components of the time-evolving graph. It minimises the number of remote accesses and improves computational efficiency through reasonable data memory layout and controlling the number of exchanges between NUMA nodes. The experimental results show that the performance of the NUMA-based delayed sending method is better than the methods provided by the current popular graph processing systems Ligra and Polymer.

关 键 词：弱连通分量 NUMA 延迟发送 时变图 图计算 

分 类 号：O157.5[理学—数学]