A programming model for BSP with partitioned synchronisation

Alan Stewart

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)421-432
Number of pages12
JournalFormal Aspects of Computing
Issue number4
Early online date17 Sep 2010
Publication statusPublished - Jul 2011


  • BSP
  • State-based reasoning
  • Partitioned synchronisation
  • UTP
  • Parallel by merge
  • Refinement
  • Weakest preconditions

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science


Dive into the research topics of 'A programming model for BSP with partitioned synchronisation'. Together they form a unique fingerprint.

Cite this