tsinghua.edu.cn PageRank has been widely used as a major factor in search engine ranking systems. However, global link graph information is required when computing PageRank, which causes prohibitive communication cost to achieve accurate results in distributed solution. In this paper, we propose a distributed PageRank computation algorithm based on iterative aggregation-disaggregation (IAD) method with Block Jacobi smoothing. The basic idea is divide-and-conquer. We treat each web site as a node to explore the block structure of hyperlinks. Local PageRank is computed by each node itself and then updated with a low communication cost with a coordinator. We prove the global convergence of the Block Jacobi method and then analyze the communication overhead and major advantages of our algorithm. Experiments on three real web graphs show that our method converges 5–7 times faster than the traditional Power method. We believe our work provides an efficient and practical distributed solution for PageRank on large scale Web graphs.
|
1524
|
Authoritative sources in a hyperlinked environment
– Kleinberg
- 1999
|
|
914
|
The pagerank citation ranking: Bringing order to the web
– Page, Brin, et al.
- 1998
|
|
96
|
Rank Correlation Methods
– Kendall
- 1990
|
|
87
|
Extrapolation Methods for Accelerating PageRank Computations
– Kamvar, Haveliwala, et al.
- 2003
|
|
83
|
Exploiting the Block Structure of the Web for Computing PageRank
– Kamvar, Haveliwala, et al.
- 2003
|
|
64
|
Ranking the Web Frontier
– Eiron, McCurley, et al.
- 2004
|
|
56
|
Deeper inside pagerank
– Langville, Meyer
- 2003
|
|
50
|
Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems
– Meyer
- 1989
|
|
46
|
WebGraph Framework I: Compression Techniques
– Boldi, Vigna
- 2004
|
|
34
|
Adaptive Methods for the Computation of PageRank
– Kamvar, Haveliwala, et al.
- 2003
|
|
23
|
Computing PageRank in a distributed Internet search engine system
– Wang, DeWitt
- 2004
|
|
21
|
A Fast Two-Stage Algorithm for Computing PageRank
– Lee, Golub, et al.
- 2003
|
|
19
|
Efficient pagerank approximation via graph aggregation
– Broder, Lempel, et al.
- 2004
|
|
19
|
A lumping method for numerical calculations of stationary distributions of Markov chains
– Takahashi
- 1975
|
|
15
|
Fast parallel PageRank: A linear system approach, tech
– Gleich, Zhukov, et al.
- 2004
|
|
7
|
Block iterative algorithms for stochastic matrices
– Courtois, Semal
- 1986
|
|
7
|
Updating pagerank with iterative aggregation
– Langville, Meyer
- 2004
|
|
7
|
Convergent Nonnegative Matrices and Iterative methods for consistent linear systems
– Neumann, Plemmons
- 1978
|
|
6
|
Matrix Methods for Queueing Problems
– Kaufman
- 1983
|
|
5
|
Convergence analysis of a pagerank updating algorithm by langville and meyer
– Ipsen, Kirkland
- 2004
|
|
5
|
A General Framework for Iterative Aggregation /Disaggregation Methods
– Kafeety, Meyer, et al.
- 1992
|
|
4
|
The mystery of asynchronous iterations convergence when the spectral radius is one
– Szyld
- 1998
|
|
3
|
Iterative aggregation/disaggregation methods
– Chatelin
- 1984
|
|
2
|
Iterative aggregation /disaggregation techniques for nearly uncoupled Markov chains
– Cao, Stewart
- 1985
|
|
2
|
How much information? project
– Lyman, Varian, et al.
- 2000
|
|
2
|
Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices, Linear Algebra and its Applications
– Marek, Mayer
- 2003
|
|
2
|
The error of aggregation in decomposable systems
– Vantilborgh
- 1981
|
|
1
|
Iterative aggregation/ disaggregation methods for computing some characteristics of markov chains
– Marek, Mayer
- 2001
|
|
1
|
A note on local and global convergence analysis of iterative aggregation -disaggregation methods. Submitted to Linear Algebra and Applications
– Marek, Pultarova
- 2005
|
|
1
|
A two stage iteration for solving nearly completely decomposable markov chains
– Stewart, Stewart, et al.
- 1993
|
