By Topic

Parallel adaptive technique for computing PageRank

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Rungsawang ; Dept. of Comput. Eng., Kasetsart Univ., Bangkok, Thailand ; B. Manaskasemsak

Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large Web graph consumes both much computing resource and time. This paper therefore proposes a parallel adaptive technique for computing PageRank using the PC cluster. Following the study of the Stanford WebBase group on convergence patterns of PageRank scores of pages using the conventional PageRank algorithm, PageRank scores of most pages converge more quickly than the remainder, we then devise our parallel adaptive algorithm to reiterate the computation for pages whose PageRank scores are still not converged. From experiments using a synthesized Web graph of 28 million pages and around 227 million hyperlinks, we obtain the acceleration rate up to 6-8 times using 32 PC processors.

Published in:

14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)

Date of Conference:

15-17 Feb. 2006