Indian Journal of Science and Technology
DOI: 10.17485/ijst/2016/v9iS1/102825
Year: 2016, Volume: 9, Issue: Special Issue 1, Pages: 1-8
Original Article
Hema Dubey1 , Nilay Khare2 and Appu Kuttan KK3
1,2Department of Computer Science and Engineering, Maulana Azad National Institute of Technology, Link Road Number 3, Near Kali Mata Mandir, Bhopal - 462003, Madhya Pradesh, India; [email protected], [email protected]
3 Department of Mechanical Engineering, National Institute of Technology, NH 66, Srinivas Nagar, Surathkal, Mangaluru - 575025, Karnataka, India; [email protected]
Background/Objectives: PageRank given by Brin and Larry in 1998, emerged as a dominant link analysis method used by web search engines for ranking of its search results. Efficient and fast computation of PageRank values for prodigious web graphs is indeed an important issue for web search engines today. Recognizing and fighting with spam web pages is also considered to be another necessary issue in web searching. Methods/Statistical Analysis: In this paper, we have proposed an efficient and accelerated parallel computation of PageRank scores on Graphics Processing Units (GPUs) which uses non even distribution of PageRank values. This work is experimented on datasets taken from Stanford Large Network Dataset Collection, on a system equipped with NVIDIA Quadro 2000 Graphics card using CUDA programming language. Findings: The proposed work has a speed up of 3.22 to 7.5 and is also capable of dealing with spam web pages. Application: The proposed algorithm helps in detecting spam web pages.
Keywords: CUDA, GPU, Parallel PageRank, Spam Web Pages
Subscribe now for latest articles and news.
