DagSemProc.08332.3.pdf
- Filesize: 107 kB
- 2 pages
Document
A Typical Verification Challenge for the GRID
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8332
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-10-30
Cite AsGet BibTex
Jaco van de Pol. A Typical Verification Challenge for the GRID. In Distributed Verification and Grid Computing. Dagstuhl Seminar Proceedings, Volume 8332, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08332.3
https://doi.org/10.4230/DagSemProc.08332.3
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.
Keywords
- Strongly connected components
- distributed algorithms
- breadth first search
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads