Imperative BSPlib-style Communications in BSML | Zendy

Frédéric Loulergue | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Imperative BSPlib-style Communications in BSML

Author(s) -

Frédéric Loulergue

Publication year - 2017

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2017.05.267

Subject(s) - computer science , spmd , parallelism (grammar) , parallel computing , programming style , programming language , functional programming , style (visual arts) , bulk synchronous parallel , parallel programming model , data parallelism , simple (philosophy) , parallel algorithm , programming paradigm , archaeology , history , philosophy , epistemology

Bulk synchronous parallelism (BSP) offers a simple model of parallelism yet allows to take realistically into account the communication costs of parallel algorithms. BSPlib and its variants are programming libraries for the C language that support the BSP style. Bulk Synchronous Parallel ML (BSML) is a library for BSP programming with the functional language OCaml. BSML programs can be seen as sequential programs working on a parallel data structure (seq of par) while a BSPlib program is written in the SPMD style and understood as a parallel composition of communicating sequential programs (par of seq). The communication styles of BSML and BSPlib are also quite different. This paper shows that BSPlib-style communications can be implemented on top of BSML, without the need to extend BSML parallel primitives.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research