Cevahir, AliAykanat, CevdetTurk, AtaCambazoğlu, B. Barla2016-02-082016-02-0820070302-9743http://hdl.handle.net/11693/27060Conference name: 8th International Workshop, PARA 2006Date of Conference: June 18-21, 2006A power method formulation, which efficiently handles the problem of dangling pages, is investigated for parallelization of PageRank computation. Hypergraph-partitioning-based sparse matrix partitioning methods can be successfully used for efficient parallelization. However, the preprocessing overhead due to hypergraph partitioning, which must be repeated often due to the evolving nature of the Web, is quite significant compared to the duration of the PageRank computation. To alleviate this problem, we utilize the information that sites form a natural clustering on pages to propose a site-based hypergraph-partitioning technique, which does not degrade the quality of the parallelization. We also propose an efficient parallelization scheme for matrix-vector multiplies in order to avoid possible communication due to the pages without in-links. Experimental results on realistic datasets validate the effectiveness of the proposed models. © Springer-Verlag Berlin Heidelberg 2007.EnglishClustering algorithmsComputation theoryData structuresParallel processing systemsProblem solvingPageRank computationParallelizationWebsitesConference Paper10.1007/978-3-540-75755-9_10810.1007/978-3-540-75755-9