All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

State-space reduction of non-deterministically synchronizing systems applicable to deadlock detection in MPI

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86098962" target="_blank" >RIV/61989100:27240/16:86098962 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/16:86098962

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-319-48989-6_7" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-48989-6_7</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-48989-6_7" target="_blank" >10.1007/978-3-319-48989-6_7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    State-space reduction of non-deterministically synchronizing systems applicable to deadlock detection in MPI

  • Original language description

    The paper is motivated by non-deterministic synchronizations in MPI (Message Passing Interface), where some send operations and collective operations may or may not synchronize; a correctly written MPI program should count with both options. Here we focus on the deadlock detection in such systems and propose the following reduction of the explored state space. The system is first analyzed without forcing the respective synchronizations, by applying standard partial-order reduction methods. Then a suggested algorithm is used that searches for potentially missed deadlocks caused by synchronization. In practical examples this approach leads to major reductions of the explored state space in comparison to encoding the synchronization options into the state-space search directly. The algorithm is presented as a stand-alone abstract framework that can be also applied to the future versions of MPI as well as to other related problem domains. (C) Springer International Publishing AG 2016.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  • ISBN

    978-3-319-48988-9

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    17

  • Pages from-to

    102-118

  • Publisher name

    Springer Verlag

  • Place of publication

    CHAM

  • Event location

    Limassol

  • Event date

    Nov 9, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000389793300007