The Community for Technology Leaders
Green Image
Issue No. 05 - May (2011 vol. 22)
ISSN: 1045-9219
pp: 786-802
Ali Cevahir , Tokyo Institute of Technology, Tokyo
Cevdet Aykanat , Bilkent University, Ankara
Ata Turk , Bilkent University, Ankara
B. Barla Cambazoglu , Yahoo! Research, Barcelona
The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrix-vector multiplications where the involved web matrices grow in parallel with the growth of the web and are stored in a distributed manner due to space limitations. Hence, the PageRank computation, which is frequently repeated, must be performed in parallel with high-efficiency and low-preprocessing overhead while considering the initial distributed nature of the web matrices. Our contributions in this work are twofold. We first investigate the application of state-of-the-art sparse matrix partitioning models in order to attain high efficiency in parallel PageRank computations with a particular focus on reducing the preprocessing overhead they introduce. For this purpose, we evaluate two different compression schemes on the web matrix using the site information inherently available in links. Second, we consider the more realistic scenario of starting with an initially distributed data and extend our algorithms to cover the repartitioning of such data for efficient PageRank computation. We report performance results using our parallelization of a state-of-the-art PageRank algorithm on two different PC clusters with 40 and 64 processors. Experiments show that the proposed techniques achieve considerably high speedups while incurring a preprocessing overhead of several iterations (for some instances even less than a single iteration) of the underlying sequential PageRank algorithm.
PageRank, sparse matrix-vector multiplication, web search, parallelization, sparse matrix partitioning, graph partitioning, hypergraph partitioning, repartitioning.

C. Aykanat, A. Turk, B. B. Cambazoglu and A. Cevahir, "Site-Based Partitioning and Repartitioning Techniques for Parallel PageRank Computation," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 786-802, 2010.
93 ms
(Ver 3.3 (11022016))