By Topic

Scalable link analysis algorithm for a distributed memory environment

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

1 Author(s)
Joy James Prabhu Arulraj ; DCSE, College of Engineering, Anna University, India

The convergence rate of iterative stationary methods for the PageRank linear system is significant for efficient computation of the relative rank of web pages based on the Web graph. This paper investigates this problem from the perspective of a message-passing framework on a distributed memory parallel programming model. A three-dimensional Web model is introduced to present a scalable link analysis algorithm that can compute the rank vector of a linear system with a high degree of convergence and accuracy. The algorithm derives its scalability by eliminating the need for any global information or page categorization. The details of the MPI-based parallel implementation and the experimental results obtained on a 8-node cluster of Intel Xeon 3.0 GHz, 1.5GB RAM machines over a 100MBit Ethernet LAN are provided. The variation in convergence behavior with residual probability is analyzed. For the WebBase crawl, a speedup of 12.45 is obtained by the scalable algorithm over the centralized algorithm.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010