 |
|
van de Pol, J.C.
(2008)
A Typical Verification Challenge for the GRID.
(Invited)
In: Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing ', 10-14 August 2008, Dagstuhl, Germany.
Dagstuhl Seminar Proceedings (08332).
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
ISSN 1862-4405
Full text available as: Official URL: http://drops.dagstuhl.de/portals/index.php?semnr=08332  AbstractA 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. | Item Type: | Conference or Workshop Paper (Full Paper, Invited/Keynote Talk) |
|---|
| Research Group: | EWI-FMT: Formal Methods and Tools |
|---|
| Research Program: | CTIT-DSN: Dependable Systems and Networks |
|---|
| Research Project: | MC=MC: Model-Checking of Infinite-State Markov Chains |
|---|
| Uncontrolled Keywords: | Strongly connected components, distributed algorithms, breadth first search |
|---|
| ID Code: | 14070 |
|---|
| Status: | Published |
|---|
| Deposited On: | 16 November 2008 |
|---|
| Refereed: | No |
|---|
| International: | Yes |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item
|
|
|
Nederlands
Contact
Sitemap
Search
Organisation