| Autor: |
Jakobsson, Arvid, Dabrowski, Frederic, Bousdira, Wadoud |
| Přispěvatelé: |
Huawei Technologies France [Boulogne-Billancour], Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA) |
| Jazyk: |
angličtina |
| Rok vydání: |
2019 |
| Předmět: |
|
| Popis: |
Bulk Synchronous Parallel (BSP) is a simple but powerful high-level model for parallel computation. Using BSPlib, programmers can write BSP programs in the general purpose language C. Direct Remote Memory Access (DRMA) communication in BSPlib is enabled using registrations: associations between the local memories of all processes in the BSP computation. However, the semantics of registration is non-trivial and ambiguously specified and thus its faulty usage is a potential source of errors. We give a formal semantics of BSPlib with which we characterize correct registration. Anticipating a static analysis, we give a simplified programming model that guarantees correct registration usage, drawing upon previous work on textual alignment. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
