License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07071.6
URN: urn:nbn:de:0030-drops-10651
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2007/1065/
Go to the corresponding Portal

Kollias, Giorgios ; Gallopoulos, Efstratios

Asynchronous Computation of PageRank computation in an interactive multithreading environment

pdf-format:
07071.KolliasGiorgios.Paper.1065.pdf (0.4 MB)

Abstract

Numerical Linear Algebra has become almost indispensable in Web
Information Retrieval.

In this presentation we suggest that the asynchronous computation model
is an attractive paradigm for organizing concurrent computations
spanning data on Web scale. This suggestion is supported by
experiments which highlight some interesting characteristics of this
model as applied to 'page ranking' methods.

After an introduction on asynchronous computing in general and 'page
ranking' in particular, we present results from the asynchronous
compution of PageRank using typical combinations of execution units
(processes, threads) and communication mechanisms (message passing,
shared memory). Sound convergence properties predicted by theory are
numerically verified and interesting patterns of behavior are
unveiled. Our experiments were performed on Jylab, an evolving
environment enabling interactive multithreading and multiprocessing
computations. This work is supported by a Pythagoras-EPEAEK-II grant
and is conducted in collaboration with Daniel Szyld.

BibTeX - Entry

@InProceedings{kollias_et_al:DagSemProc.07071.6,
  author =	{Kollias, Giorgios and Gallopoulos, Efstratios},
  title =	{{Asynchronous Computation of PageRank computation in an interactive multithreading environment}},
  booktitle =	{Web Information Retrieval and Linear Algebra Algorithms},
  pages =	{1--13},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7071},
  editor =	{Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/1065},
  URN =		{urn:nbn:de:0030-drops-10651},
  doi =		{10.4230/DagSemProc.07071.6},
  annote =	{Keywords: Asynchronous, pagerank, multithreading, multiprocessing}
}

Keywords: Asynchronous, pagerank, multithreading, multiprocessing
Collection: 07071 - Web Information Retrieval and Linear Algebra Algorithms
Issue Date: 2007
Date of publication: 28.06.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI