A heuristic relaxed extrapolated algorithm for accelerating PageRank. (June 2018)

• Record Type: Journal Article
• Authors: Migallón, Héctor; Migallón, Violeta; Palomino, Juan A.; Penadés, José
• Is Part Of: Advances in engineering software. Volume 120(2018)
• Page Start: 88
• Page End: 95
• Publication Date: 2018-06
• Subjects: PageRank -- Parallel algorithms -- Power method -- Relaxation and extrapolation -- Shared memory -- Distributed memory; Computer-aided engineering -- Periodicals; Engineering -- Computer programs -- Periodicals; Engineering -- Software -- Periodicals; Periodicals; 620.0028553
• DOI: 10.1016/j.advengsoft.2016.01.024
• Languages: English
• ISSNs: 0965-9978

Abstract

Abstract: 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.