A heuristic relaxed extrapolated algorithm for accelerating PageRank

作者：Migallon Hector^*; Migallon Violeta; Palomino Juan A; Penades Jose

来源：Advances in Engineering Software, 2018, 120: 88-95.

DOI：10.1016/j.advengsoft.2016.01.024

• PageRank
• Parallel algorithms
• Power method
• Relaxation and extrapolation
• Shared memory
• Distributed memory

The PageRank algorithm for determining the importance of Web pages has become a central technique in Web search. This algorithm uses the Power method to compute successive iterates that converge to the principal eigenvector of the Markov chain representing the Web link graph. In this work we present an effective heuristic Relaxed and Extrapolated algorithm based on the Power method that accelerates its convergence. A hybrid parallel implementation of this algorithm has been designed by combining various OpenMP threads for each MPI process and several strategies of data distribution among nodes have been analyzed. The results show that the proposed algorithm can significantly speed up the convergence time with respect to the parallel Power algorithm.

• 出版日期2018-6