Replicated Synchronization for Imperative BSP Programs

To appearInternational audienceThe BSP model (Bulk Synchronous Parallel) simplifies the constructionand evaluation of parallel algorithms, with its simplifiedsynchronization structure and cost model. Nevertheless, imperativeBSP 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 flowanalysis, which verifies statically whether an imperative BSP program hasreplicated synchronization, which is a sufficient condition for textual barrier alignment