Fast Parallel PageRank: A Linear System Approach

In this paper we investigate the convergence of iterative stationary and Krylov subspace methods for the PageRank linear system, including the convergence dependency on teleportation. We demonstrate that linear system iterations converge faster than the simple power method and are less sensitive to the changes in teleportation. In order to perform this study we developed a framework for parallel PageRank computing. We describe the details of the parallel implementation and provide experimental results obtained on a 70-node Beowulf cluster.

[1]  Pavel Berkhin,et al.  A Survey on PageRank Computing , 2005, Internet Math..

[2]  Vipin Kumar,et al.  A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm , 1997, PP.

[3]  William Gropp,et al.  Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries , 1997, SciTools.

[4]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[5]  Andrei Z. Broder,et al.  Efficient pagerank approximation via graph aggregation , 2004, WWW Alt. '04.

[6]  Hector Garcia-Molina,et al.  Combating Web Spam with TrustRank , 2004, VLDB.

[7]  Gene H. Golub,et al.  Exploiting the Block Structure of the Web for Computing , 2003 .

[8]  Taher H. Haveliwala.  Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[9]  Arnon Rungsawang,et al.  Parallel PageRank computation on a gigabit PC cluster , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[10]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[11]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[12]  Martin G. Everett,et al.  Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes , 1997, J. Parallel Distributed Comput..

[13]  W. Stewart.  Numerical Methods for Computing Stationary Distributions of Finite Irreducible Markov Chains , 2000 .

[14]  Hector Garcia-Molina,et al.  Efficient Crawling Through URL Ordering , 1998, Comput. Networks.

[15]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[16]  James Demmel,et al.  SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems , 2003, TOMS.

[17]  Gene H. Golub,et al.  Extrapolation methods for accelerating PageRank computations , 2003, WWW '03.

[18]  Kevin S. McCurley,et al.  Ranking the web frontier , 2004, WWW '04.

[19]  Carl D. Meyer,et al.  Deeper Inside PageRank , 2004, Internet Math..

[20]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[21]  Taher H. Haveliwala,et al.  Adaptive methods for the computation of PageRank , 2004 .

[22]  O. Axelsson.  Iterative solution methods , 1995 .

[23]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[24]  Jasmine Novak,et al.  PageRank Computation and the Structure of the Web: Experiments and Algorithms , 2002 .

[25]  Taher H. Haveliwala,et al.  The Second Eigenvalue of the Google Matrix , 2003 .