Partition-Based Parallel PageRank Algorithm

A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web graph. Researchers propose to compute them sequentially by reducing the cost of disk access, improving the convergence rate, or even employing Peer-2-Peer architecture, etc. However, only afew concentrate on computation using parallel processing techniques. In this paper, we propose a Partition-based parallel PageRank algorithm that can be run on a low-cost parallel environment like PC cluster. For comparison, we also study other two well-known PageRank techniques, and provide an analytical discussion of their performance in terms synchronization cost, as well as memory usage. Experimental results show a promising improvement on a large web graph synthesized from the domain.

• Type: Conference
• Year: 2005
• Where: ICITA
• Authors: Arnon Rungsawang, Bundit Manaskasemsak
• Keywords: ICITA 2005, Information Technology, Large Web Graph, PageRank, Parallel Pagerank Algorithm