A Typical Verification Challenge for the GRID

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    15 Downloads (Pure)

    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.
    Original languageUndefined
    Title of host publicationDagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing '
    EditorsH. E. Bal, L. Brim, M. Leucker
    Place of PublicationDagstuhl, Germany
    PublisherDagstuhl
    Pages-
    Number of pages2
    ISBN (Print)1862-4405
    Publication statusPublished - 2008

    Publication series

    NameDagstuhl Seminar Proceedings
    PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
    Number08332
    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

    van de Pol, J. C. (2008). A Typical Verification Challenge for the GRID. In H. E. Bal, L. Brim, & M. Leucker (Eds.), Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing ' (pp. -). (Dagstuhl Seminar Proceedings; No. 08332). Dagstuhl, Germany: Dagstuhl.