Building BSP Programs Using the Refinement Calculus

Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed for sequential computing can be generalised to (some) parallel computing environments, and may be useful for managing some of the details of programming in such situations.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: David B. Skillicorn
• Keywords: Bulk Synchronous Parallelism, Distributed And Parallel Computing, IPPS 1998, Parallel Computing Environments, Refinement Calculus