.png){kind=icon}
Return
A heuristic relaxed extrapolated algorithm for accelerating PageRank
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2016.01.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2016 Civil-Comp Ltd. and Elsevier Ltd. All rights reserved.
Keywords:
PageRank
Parallel algorithms
Power method
Relaxation and extrapolation
Shared memory
Distributed memory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.4K
Citations:
1.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave no more
no more