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

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/61989100:27740/16:86098962

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2016

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

—

Počet stran výsledku

17

Strana od-do

102-118

Název nakladatele

Springer Verlag

Místo vydání

CHAM

Místo konání akce

Limassol

Datum konání akce

9. 11. 2016

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000389793300007