Computational Technology Resources - CCP

H. Migallón¹, V. Migallón² and J. Penadés²

¹Department of Physics and Computer Architectures, University Miguel Hernández, Alicante, Spain
²Department of Computer Science and Artificial Intelligence, University of Alicante, Alicante, Spain

doi:10.4203/ccp.111.32

purchase the full-text of this paper

H. Migallon, V. Migallon, J. Penades, "Parallel Computation of PageRank using Two-Stage Methods", in , (Editors), "Proceedings of the Fifth International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 32, 2017. doi:10.4203/ccp.111.32

Keywords: parallel algorithm, PageRank, two-stage methods, shared memory, distributed memory.

Summary

In this work we present parallel algorithms based on the use of two-stage methods for solving the PageRank problem as a linear system. Different parallel versions of these methods are explored and their convergence properties are analyzed. The parallel implementation has been developed using a mixed MPI/OpenMP model to exploit parallelism beyond a single level. In order to investigate and analyze the proposed parallel algorithms, we have used several realistic large datasets. The numerical results show that the proposed algorithms can significantly speed up the convergence time with respect to the parallel Power algorithm and behave better than other well-known techniques.

purchase the full-text of this paper (price £22)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £45 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 111 PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by: Paper 32 Parallel Computation of PageRank using Two-Stage Methods H. Migallón¹, V. Migallón² and J. Penadés² ¹Department of Physics and Computer Architectures, University Miguel Hernández, Alicante, Spain ²Department of Computer Science and Artificial Intelligence, University of Alicante, Alicante, Spain doi:10.4203/ccp.111.32 purchase the full-text of this paper Full Bibliographic Reference for this paper H. Migallon, V. Migallon, J. Penades, "Parallel Computation of PageRank using Two-Stage Methods", in , (Editors), "Proceedings of the Fifth International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 32, 2017. doi:10.4203/ccp.111.32 Keywords: parallel algorithm, PageRank, two-stage methods, shared memory, distributed memory. Summary In this work we present parallel algorithms based on the use of two-stage methods for solving the PageRank problem as a linear system. Different parallel versions of these methods are explored and their convergence properties are analyzed. The parallel implementation has been developed using a mixed MPI/OpenMP model to exploit parallelism beyond a single level. In order to investigate and analyze the proposed parallel algorithms, we have used several realistic large datasets. The numerical results show that the proposed algorithms can significantly speed up the convergence time with respect to the parallel Power algorithm and behave better than other well-known techniques. purchase the full-text of this paper (price £22) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £45 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions