Fast parallel computation of PageRank scores with improved convergence time Online publication date: Fri, 08-Apr-2022
by Hema Dubey; Nilay Khare
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 14, No. 1, 2022
Abstract: PageRank is a conspicuous link-based approach used by many search engines in order to rank its search results. PageRank algorithm is based on performing iterations for calculating PageRank of web pages until the convergent point is met. The computational cost of this algorithm is very high for very large web graphs. So to overcome this drawback, in this paper we have proposed a fast parallel computation of PageRank which uses standard deviation technique to normalise the PageRank score of each web page. The proposed work is experimented on standard datasets taken from Stanford large network dataset collection, on a machine having multicore architecture using CUDA programming paradigm. We observed from the experiments that the proposed fast parallel PageRank algorithm needs lesser number of iterations to converge as compared to existing parallel PageRank method. We also determined that there is a speed up of about 2 to 10 for nine different standard datasets for the proposed algorithm over the existing algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook