A Typical Verification Challenge for the GRID

Share/Save/Bookmark

Pol van de, Jaco (2008) A Typical Verification Challenge for the GRID. In: Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing ', 10-14 August 2008, Dagstuhl, Germany.

[img]
Preview
PDF
107Kb
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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65101
Official URL:http://drops.dagstuhl.de/portals/index.php?semnr=08332
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 252106