A programming model for BSP with partitioned synchronisation

DOI10.1007/S00165-010-0163-2zbMATH Open1225.68061OpenAlexW1989146297MaRDI QIDQ640293FDOQ640293

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

Recommendations

• AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
• scientific article; zbMATH DE number 1760046
• Barrier synchronisation: Axiomatisation and relaxation
• A new parallel model for the analysis of asynchronous algorithms
• Axiomatization and characterization of BSP algorithms

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)

Cites Work

• Title not available (Why is that?)
• Refinement Calculus
• An axiomatic basis for computer programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A constructive approach to the problem of program correctness
• 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

Cited In (4)

• NestStep: Nested parallelism and virtual shared memory for the BSP model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Barrier synchronisation: Axiomatisation and relaxation

Uses Software

• MPI
• BSPedupack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640293)