Replicated Synchronization for Imperative BSP Programs

Abstract : The BSP model (Bulk Synchronous Parallel) simplifies the construction and evaluation of parallel algorithms, with its simplified synchronization structure and cost model. Nevertheless, imperative BSP programs can suffer from synchronization errors. Programs with textually aligned barriers are free from such errors, and this structure eases program comprehension. Replicated synchronization is a sufficient condition for the absence of such errors. We propose a simplified formalization of barrier inference as data flow analysis, which verifies statically whether an imperative BSP program has replicated synchronization, which is a sufficient condition for textual barrier alignment.
Type de document :
Communication dans un congrès
International Conference on Computational Science (ICCS), 2017, Zürich, Switzerland. Elsevier., Procedia Computer Sciences, Procedia Computer Science
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01494832
Contributeur : Frédéric Dabrowski <>
Soumis le : vendredi 24 mars 2017 - 09:58:44
Dernière modification le : dimanche 2 juillet 2017 - 22:22:47

Identifiants

  • HAL Id : hal-01494832, version 1

Collections

Citation

Arvid Jakobsson, Frederic Dabrowski, Wadoud Bousdira, Frédéric Loulergue, Gaetan Hains. Replicated Synchronization for Imperative BSP Programs. International Conference on Computational Science (ICCS), 2017, Zürich, Switzerland. Elsevier., Procedia Computer Sciences, Procedia Computer Science. 〈hal-01494832〉

Partager

Métriques

Consultations de la notice

161