A heuristic relaxed extrapolated algorithm for accelerating PageRank

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.This research was partially supported by the Spanish Ministry of Science and Innovation under Grant Number TIN2011-26254 and Grant Number TIN2015-66972-C5-4-R, and by the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT)