A programming model for BSP with partitioned synchronisation

Authors:
Alan Stewart
Affiliations:
The Queen’s University of Belfast, School of Computer Science, BT7 1NN, Belfast, Northern Ireland, UK
Venue:
Formal Aspects of Computing
Year:
2011

Citing 0
Cited 1

SGL: towards a bridging model for heterogeneous hierarchical platforms

International Journal of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

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.