Efficient Parallel Computation of PageRank [chapter]

Christian Kohlschütter, Paul-Alexandru Chirita, Wolfgang Nejdl
2006 Lecture Notes in Computer Science  
PageRank inherently is massively parallelizable and distributable, as a result of web's strict host-based link locality. In this paper we show that the Gauß-Seidel iterative method for solving linear systems can be successfully applied in such a parallel ranking scenario in order to improve convergence. By introducing a two-dimensional web model and by adapting the PageRank to this environment, we present and evaluate efficient methods to compute the exact rank vector even for large-scale web
more » ... aphs in only a few minutes and iteration steps, with intrinsic support for incremental web crawling, and without the need for page sorting/reordering or for sharing global information. r = (1 − α) · τ + α Ar (2)
doi:10.1007/11735106_22 fatcat:cwwh7j2775e4tgunvoob5iyqqa