A distributed randomized approach for the PageRank computation: Part 2

In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the obtained results. The algorithm determines the importance of each web page based on the link structure of the web. In this two-part paper, we propose a distributed randomized approach for the PageRank computation, where the pages locally update their values by communicating with linked pages. This paper is the second part, and we develop two enhanced distributed schemes which deal with simultaneous updates and update termination of the computations, respectively.