Grid Based Parallel and Schedule Algorithm for Betweenness Computation in Telecom Social Network Graph
Yanhui Wang · Beijing Youdian Xueyuan xuebao · 2006
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.