Hypergraph partitioning for faster parallel PageRank computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3670 LNCS, Issue , 2005, Pages 155-171

  Bradley, Jeremy T ^a   De Jager, Douglas V ^a   Knottenbelt, William J ^a   Trifunović, Aleksandar ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; PARALLEL ALGORITHMS; SEARCH ENGINES; WORLD WIDE WEB;

COMPUTATIONAL LOAD BALANCE; HYPERGRAPH PARTITIONING; PARALLEL PAGERANK COMPUTATION; TRANSITION MATRIX;

COMPUTATIONAL METHODS;

EID: 33646152320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11549970_12     Document Type: Conference Paper

References (21)

1. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank citation ranking: Bringing order to the web," Tech. Rep. 1999-66, Stanford Univ., November 1999.
2. T. H. Haveliwala, "Topic sensitive PageRank: A context-sensitive ranking algorithm for web search," Tech. Rep., Stanford University, March 2003.
3. C. Alpert, J.-H. Huang, and A. Kahng, "Recent Directions in Netlist Partitioning," Integration, the VLSI Journal, vol. 19, no. 1-2, pp. 1-81, 1995.
4. U. V. Catalyurek and C. Aykanat, "Hypergraph-partitioning-based decomposition for parallel sparse matrix-vector multiplication," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 7, pp. 673-693, 1999.
5. B. Vastenhouw and R. H. Bisseling, "A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication," SIAM Review, vol. 47, no. 1, pp. 67-95, 2005.
6. A. Trifunovic and W. J. Knottenbelt, "Parkway2.0: A Parallel Multilevel Hypergraph Partitioning Tool," in Proc. 19th International Symposium on Computer and Information Sciences (C. Aykanat, T. Dayar, and I. Korpeoglu, eds.), vol. 3280 of Lecture Notes in Computer Science, pp. 789-800, Springer, 2004.
7. E. Boman, K. Devine, R. Heaphy, U. Catalyurek, and R. Bisseling, "Parallel hypergraph partitioning for scientific computing," Tech. Rep. SAND05-2796C, Sandia National Laboratories, Albuquerque, NM, April 2005.
8. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub, "Extrapolation methods for accelerating PageRank computations," in Twelfth International World Wide Web Conference, (Budapest, Hungary), pp. 261-270, ACM, May 2003.
9. D. de Jager, "PageRank: Three distributed algorithms," M.Sc. thesis, Department of Computing, Imperial College London, London SW7 2BZ, UK, September 2004.
10. A. N. Langville and C. D. Meyer, "Deeper inside PageRank," Internet Mathematics, vol. 1, no. 3, pp. 335-400, 2004.
11. T. H. Haveliwala and S. D. Kamvar, "The second eigenvalue of the google matrix," Tech. Rep., Computational Mathematics, Stanford University, March 2003.
12. "Google." http://www.google.com/. 20th June 2005.
13. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub, "Exploiting the block structure of the web for computing PageRank," Stanford database group tech. rep., Computational Mathematics, Stanford University, March 2003.
14. D. Gleich, L. Zhukov, and P. Berkhin, "Fast parallel PageRank: A linear system approach," Tech. Rep., Institute for Computation and Mathematical Engineering, Stanford University, 2004.
15. U. V. Catalyurek and C. Aykanat, "A Fine-Grain Hypergraph Model for 2D Decomposition of Sparse Matrices," in Proc. 8th International Workshop on Solving Irregularly Structured Problems in Parallel, (San Francisco, USA), April 2001.
16. B. Ucar and C. Aykanat, "Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiples," SIAM Journal of Scientific Computing, vol. 25, no. 6, pp. 1837-1859, 2004.
17. B. A. Hendrickson, "Graph partitioning and parallel solvers: Has the Emperor no clothes," in Proc. Irregular'98, vol. 1457 of LNCS, pp. 218-225, Springer, 1998.
18. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide, to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
19. A. Trifunovic and W. Knottenbelt, "A Parallel Algorithm for Multilevel k-way Hypergraph Partitioning," in Proc. 3rd International Symposium on Parallel and Distributed Computing, (University College Cork, Ireland), pp. 114-121, July 2004.
20. T. Davis, "University of Florida Sparse Matrix Collection," March 2005. http://www.cise.ufl.edu/rescarch/sparse/matrices.
21. "UbiCrawler project." http://webgraph-data.dsi.unimi.it/.