By Topic

Fast PageRank Computation on a GPU Cluster

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
$31 $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)
Rungsawang, A. ; Dept. of Comput. Eng., Kasetsart Univ., Bangkok, Thailand ; Manaskasemsak, B.

We investigate the use of graphics processing units (GPUs) in accelerating Page Rank computation. We first introduce a compact web graph representation which requires much less memory allocation than a well-known compressed sparse row format. The web graph is then simply partition into smaller chunks to fit the GPUs' device memory. We propose a fast Page Rank algorithm to run on the GPU cluster. The design of algorithm is general and does not constrain on any large web graph fitting to the limited size of device memory. In the experiments, we test our Page Rank algorithm on a small GPU cluster, using a set of real web data. We compare the parallel Page Rank computation utilizing GPUs with CPUs. The results show that the proposed Page Rank computation on GPUs gives promising result.

Published in:

Parallel, Distributed and Network-Based Processing (PDP), 2012 20th Euromicro International Conference on

Date of Conference:

15-17 Feb. 2012