A programming model for BSP with partitioned synchronisation

Alan Stewart

doi:10.1007/s00165-010-0163-2

A programming model for BSP with partitioned synchronisation

Alan Stewart

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	421-432
Number of pages	12
Journal	Formal Aspects of Computing
Volume	23
Issue number	4
Early online date	17 Sept 2010
DOIs	https://doi.org/10.1007/s00165-010-0163-2
Publication status	Published - Jul 2011

Keywords

BSP
State-based reasoning
Partitioned synchronisation
UTP
Parallel by merge
Reﬁnement
Weakest preconditions

ASJC Scopus subject areas

Software
Theoretical Computer Science

Access to Document

10.1007/s00165-010-0163-2

Cite this

@article{05140e5fcf3f4e15bc19bbeb1cbbc7b4,

title = "A programming model for BSP with partitioned synchronisation",

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 = "BSP, State-based reasoning, Partitioned synchronisation, UTP, Parallel by merge, Reﬁnement, Weakest preconditions",

author = "Alan Stewart",

year = "2011",

month = jul,

doi = "10.1007/s00165-010-0163-2",

language = "English",

volume = "23",

pages = "421--432",

journal = "Formal Aspects of Computing",

issn = "0934-5043",

publisher = "Association for Computing Machinery",

number = "4",

}

TY - JOUR

T1 - A programming model for BSP with partitioned synchronisation

AU - Stewart, Alan

PY - 2011/7

Y1 - 2011/7

N2 - 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.

AB - 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.

KW - BSP

KW - State-based reasoning

KW - Partitioned synchronisation

KW - UTP

KW - Parallel by merge

KW - Reﬁnement

KW - Weakest preconditions

U2 - 10.1007/s00165-010-0163-2

DO - 10.1007/s00165-010-0163-2

M3 - Article

SN - 0934-5043

VL - 23

SP - 421

EP - 432

JO - Formal Aspects of Computing

JF - Formal Aspects of Computing

IS - 4

ER -

A programming model for BSP with partitioned synchronisation

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this