Hypergraph Partitioning for Faster Parallel PageRank Computation

The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix derived from the web’s hyperlink structure and a user-centred model of web-surfing behaviour. As the web has expanded and as demand for user-tailored web page ordering metrics has grown, scalable parallel computation of PageRank has become a focus of considerable research effort. In this paper, we seek a scalable problem decomposition for parallel PageRank computation, through the use of state-of-the-art hypergraph-based partitioning schemes. These have not been previously applied in this context. We consider both one and two-dimensional hypergraph decomposition models. Exploiting the recent availability of the Parkway 2.1 parallel hypergraph partitioner, we present empirical results on a gigabit PC cluster for three publicly available web graphs. Our results show that hypergraph-based partitioning substa...

• Type: Conference
• Year: 2005
• Where: EPEW
• Authors: Jeremy T. Bradley, Douglas V. de Jager, William J. Knottenbelt, Aleksandar Trifunovic
• Keywords: EPEW 2005, Hypergraph-based Partitioning, Parallel Pagerank Computation, Partitioning Schemes