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.08332.3
URN: urn:nbn:de:0030-drops-16293
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1629/
|
Go to the corresponding Portal |
van de Pol, Jaco
A Typical Verification Challenge for the GRID
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:DagSemProc.08332.3,
author = {van de Pol, Jaco},
title = {{A Typical Verification Challenge for the GRID}},
booktitle = {Distributed Verification and Grid Computing},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2008},
volume = {8332},
editor = {Henri E. Bal and Lubos Brim and Martin Leucker},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2008/1629},
URN = {urn:nbn:de:0030-drops-16293},
doi = {10.4230/DagSemProc.08332.3},
annote = {Keywords: Strongly connected components, distributed algorithms, breadth first search}
}
|
Keywords: |
|
Strongly connected components, distributed algorithms, breadth first search |
|
Collection: |
|
08332 - Distributed Verification and Grid Computing |
|
Issue Date: |
|
2008 |
|
Date of publication: |
|
30.10.2008 |
