Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM

• Papers • Previous Articles     Next Articles

Grid Based Parallel and Schedule Algorithm for Betweenness Computation in Telecom Social Network Graph

CHEN Ping, WANG Bai, XU Liu-Tong, WU Bin, WANG Yan-Hui   

  1. Telecom Software Engineering Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2006-01-25 Revised:1900-01-01 Online:2006-05-30 Published:2006-05-30
  • Contact: CHEN Ping
  • Supported by:
     

Abstract: For betweeness computation in Telecom Social Network graph with huge amount of data, a grid based parallel algorithm is presented. It adopts the hierarchic dichotomy of data. Meanwhile a new schedule strategy is proposed, that combines static and dynamic methods to reach load balance. The experimental results justified that the algorithm achieves a higher speedup ratio and the parallel efficiency, and the time consumption is approximately proportion to the number of parallel CPUs as well.

Key words: complex network, telecom social network, betweeness, grid parallel computation, task scheduling algorithm

CLC Number: