Formal Aspects of Computing

, Volume 23, Issue 4, pp 421–432

A programming model for BSP with partitioned synchronisation

Authors

    • School of Computer ScienceThe Queen’s University of Belfast
Open AccessOriginal Article

DOI: 10.1007/s00165-010-0163-2

Cite this article as:
Stewart, A. Form Asp Comp (2011) 23: 421. doi:10.1007/s00165-010-0163-2

Abstract

A BSP superstep is a distributed computation comprising a number of simultaneously executing processes which may generate asynchronous messages. A superstep terminates with a barrier which enforces a global synchronisation and delivers all ongoing communications. Multilevel supersteps can utilise barriers in which subsets of processes, interacting through shared memories, are locally synchronised (partitioned synchronisation). In this paper a state-based semantics, closely related to the classical sequential programming model, is derived for distributed BSP with partitioned synchronisation.

Keywords

BSPState-based reasoningPartitioned synchronisationUTPParallel by mergeRefinementWeakest preconditions
Download to read the full article text

Copyright information

© British Computer Society 2010