Functional Parallel Programming with Revised Bulk Synchronous Parallel ML

Abstract : Bulk Synchronous Parallel ML or BSML is a high-level language for programming parallel algorithms. Built upon the Objective Caml language, it provides a safe setting for implementing Bulk Synchronous Parallel (BSP) algorithms. It avoids concurrency related problems: deadlocks and non- determinism. BSML is based on a very small core of parallel primitives that extended functional sequential programming to functional BSP programming with a parallel data structure and operations to manipulate it. However, in practice the primitives for writing the parallel non-communicating parts of the program are not so easy to use. Thus we designed a new syntax that makes programs easier to write and read. Revised BSML is presented and its expressiveness and performance are illustrated through an application example.
Document type :
Conference papers
Koji Nakano. 2nd International Workshop on Parallel and Distributed Algorithms and Applications (PDAA), 2010, Hiroshima, Japan. IEEE Computer Society, pp.191-196, 2010, 〈10.1109/IC-NC.2010.57〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00515223
Contributor : Frédéric Loulergue <>
Submitted on : Monday, September 6, 2010 - 11:33:43 AM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM

Identifiers

Citation

Wadoud Bousdira, Frédéric Gava, Louis Gesbert, Frédéric Loulergue, Guillaume Petiot. Functional Parallel Programming with Revised Bulk Synchronous Parallel ML. Koji Nakano. 2nd International Workshop on Parallel and Distributed Algorithms and Applications (PDAA), 2010, Hiroshima, Japan. IEEE Computer Society, pp.191-196, 2010, 〈10.1109/IC-NC.2010.57〉. 〈inria-00515223〉

Share

Metrics

Record views

229