A programming model for BSP with partitioned synchronisation

DOI10.1007/S00165-010-0163-2zbMath1225.68061OpenAlexW1989146297MaRDI QIDQ640293

Alan Stewart

Publication date: 18 October 2011

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-010-0163-2

zbMATH Keywords

refinementweakest preconditionsBSPparallel by mergepartitioned synchronisationstate-based reasoningUTP

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Uses Software

• MPI
• BSPedupack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariant based programming: Basic approach and teaching experiences
• The bulk-synchronous parallel random access machine
• A calculus of functional BSP programs
• Barrier synchronisation: Axiomatisation and relaxation
• BSP-style Computation: a Semantic Investigation
• A Bridging Model for Multi-core Computing
• Refinement Calculus
• A constructive approach to the problem of program correctness
• An axiomatic basis for computer programming

This page was built for publication: A programming model for BSP with partitioned synchronisation