License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-16293
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1629/
Go to the corresponding Portal

van de Pol, Jaco

A Typical Verification Challenge for the GRID

pdf-format:
Document 1.pdf (108 KB)

Abstract

A typical verification challenge for the GRID community is presented. The concrete challenge is to implement a simple recursive algorithm for finding the strongly connected components in a graph. The graph is typically stored in the collective memory of a number of computers, so a distributed algorithm is necessary. The implementation should be efficient and scalable, and separate synchronization and implementation details from the purely algorithmic aspects. In the end, a framework is envisaged for distributed algorithms on very large graphs. This would be useful to explore various alternative algorithmic choices.

BibTeX - Entry

@InProceedings{vandepol:DSP:2008:1629,
  author =	{Jaco van de Pol},
  title =	{A Typical Verification Challenge for the GRID},
  booktitle =	{Distributed Verification and Grid Computing },
  year =	{2008},
  editor =	{Henri E. Bal and Lubos Brim and Martin Leucker},
  number =	{08332},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1629},
  annote =	{Keywords: Strongly connected components, distributed algorithms, breadth first search}
}

Keywords: Strongly connected components, distributed algorithms, breadth first search
Seminar: 08332 - Distributed Verification and Grid Computing
Issue Date: 2008
Date of publication: 30.10.2008

DROPS-Home | Fulltext Search | Imprint Published by LZI