Implementation of a parallel graph partition algorithm to speed up BSP computing

摘要：

　　The processing and mining information in large scale graph data have proven to be challenging.The bulk synchronous parallel(BSP)computing model is suitable for this task.In this paper,we implement the multi-level step-wise partitioning(MSP)algorithm in BSP programming model,and replace the original graph partition method.The results on both experimental data and real world data proved this improvement achieved better data locality,reduced communication between work nodes,and it made a better performance than the original method.

关键词： complex network MapReduce BSP HAMA graph partition

作者: Shengmei Luo Lixia Liu Hongxu Wang Bin Wu Yang Liu

作者单位: Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P. R. China Zhongxing Telecom Equipment Corporation, Nanjing 210012, P. R. China Beijing University of Posts and Telecommunications, Beijing 100876, P. R. China

会议类型: 国际会议

会议名称: The 2014 10th International Conference on Natural Computation (ICNC 2014) and the 2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2014)(第十届自然计算和第十一届模糊系统与知识发现国际会议)

会议地点: 厦门

会议语种:英文

页码: 751-755

在线出版日期: 2014-08-19（万方平台首次上网日期，不代表论文的发表时间）