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
国际会议
厦门
英文
751-755
2014-08-19(万方平台首次上网日期,不代表论文的发表时间)