A calculus of functional BSP programs with projection

Bulk Synchronous Parallel ML (BSML) is an extension of the functional language Objective Caml to program Bulk Synchronous Parallel (BSP) algorithms. It is deterministic, deadlock free and performances are good and predictable. Parallelism is expressed with a set of 4 primitives on a parallel data structure called parallel vector. These primitives are pure functional ones: they have no side-effect. It is thus possible, and we did it, to prove the correctness of BSML programs using a proof assistant like Coq. The BSλ-calculus is an extension of the λ-calculus which models the core semantics of BSML. Nevertheless some principles of BSML are not well captured by this calculus. This paper presents a new calculus, with a projection primitive, which provides a better model of the core semantics of BSML.

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Frédéric Loulergue
• Keywords: Bulk Synchronous Parallel, Core Semantics, Distributed And Parallel Computing, IPPS 2006, Synchronous Parallel ML