A heuristic relaxed extrapolated algorithm for accelerating PageRank
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/75659
Título: | A heuristic relaxed extrapolated algorithm for accelerating PageRank |
---|---|
Autor/es: | Migallón Gomis, Héctor | Migallón, Violeta | Palomino Benito, Juan | Penadés, Jose |
Grupo/s de investigación o GITE: | Computación de Altas Prestaciones y Paralelismo (gCAPyP) |
Centro, Departamento o Servicio: | Universidad de Alicante. Departamento de Ciencia de la Computación e Inteligencia Artificial |
Palabras clave: | PageRank | Parallel algorithms | Power method | Relaxation and extrapolation | Shared memory | Distributed memory |
Área/s de conocimiento: | Ciencia de la Computación e Inteligencia Artificial |
Fecha de publicación: | jun-2018 |
Editor: | Elsevier |
Cita bibliográfica: | Advances in Engineering Software. 2018, 120: 88-95. doi:10.1016/j.advengsoft.2016.01.024 |
Resumen: | 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. |
Patrocinador/es: | 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). |
URI: | http://hdl.handle.net/10045/75659 |
ISSN: | 0965-9978 (Print) | 1873-5339 (Online) |
DOI: | 10.1016/j.advengsoft.2016.01.024 |
Idioma: | eng |
Tipo: | info:eu-repo/semantics/article |
Derechos: | © 2016 Civil-Comp Ltd. and Elsevier Ltd. |
Revisión científica: | si |
Versión del editor: | https://doi.org/10.1016/j.advengsoft.2016.01.024 |
Aparece en las colecciones: | INV - gCAPyP - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2018_Migallon_etal_AdvEngSoft_final.pdf | Versión final (acceso restringido) | 573,67 kB | Adobe PDF | Abrir Solicitar una copia |
2018_Migallon_etal_AdvEngSoft_preprint.pdf | Preprint (acceso abierto) | 1,13 MB | Adobe PDF | Abrir Vista previa |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.