| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4960984 | Procedia Computer Science | 2017 | 10 Pages |
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. 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Arvid Jakobsson, Frédéric Dabrowski, Wadoud Bousdira, Frédéric Loulergue, Gaetan Hains,