### Abstract

Original language | Undefined |
---|---|

Title of host publication | Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing ' |

Editors | H. E. Bal, L. Brim, M. Leucker |

Place of Publication | Dagstuhl, Germany |

Publisher | Dagstuhl |

Pages | - |

Number of pages | 2 |

ISBN (Print) | 1862-4405 |

Publication status | Published - 2008 |

### Publication series

Name | Dagstuhl Seminar Proceedings |
---|---|

Publisher | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany |

Number | 08332 |

ISSN (Print) | 1862-4405 |

### Keywords

- METIS-252106
- EWI-14070
- Distributed algorithms
- IR-65101
- Strongly connected components
- breadth first search
- FMT-MC: MODEL CHECKING

### Cite this

*Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing '*(pp. -). (Dagstuhl Seminar Proceedings; No. 08332). Dagstuhl, Germany: Dagstuhl.

}

*Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing '.*Dagstuhl Seminar Proceedings, no. 08332, Dagstuhl, Dagstuhl, Germany, pp. -.

**A Typical Verification Challenge for the GRID.** / van de Pol, Jan Cornelis.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - A Typical Verification Challenge for the GRID

AU - van de Pol, Jan Cornelis

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - METIS-252106

KW - EWI-14070

KW - Distributed algorithms

KW - IR-65101

KW - Strongly connected components

KW - breadth first search

KW - FMT-MC: MODEL CHECKING

M3 - Conference contribution

SN - 1862-4405

T3 - Dagstuhl Seminar Proceedings

SP - -

BT - Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing '

A2 - Bal, H. E.

A2 - Brim, L.

A2 - Leucker, M.

PB - Dagstuhl

CY - Dagstuhl, Germany

ER -