| HAL: inria-00452527, version 1 |
| DOI: 10.1016/j.future.2009.05.021 |
| See detailed view | BibTeX,EndNote,... |
|
|
| Future Generation Computer Systems 26 (2010) 486-490 |
|
|
|
|
| Bulk Synchronous Parallel ML with Exceptions |
|
|
| Louis Gesbert 1Frédéric Gava 1 |
|
|
| (2010-03) |
|
|
| Bulk Synchronous Parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementation, avoiding concurrency related problems (deadlocks, indeter\-mi\-nism). Only a limited set of the features of OCaml can be used in BSML to respect its properties of safety: this paper describes a way to add exception handling to this set by extending and adapting OCaml's exceptions. The behaviour of these new exceptions and the syntactic constructs to handle them, together with their implementation, are described in detail, and results over an example are given. |
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Algorithmique Complexité et Logique (LACL) |
| CNRS : FRE2673 – Université Paris XII - Paris Est Créteil Val-de-Marne | |
| 2: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
| Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges | |
|
|
|
|
|
|
|
|
| inria-00452527, version 1 | |
| http://hal.inria.fr/inria-00452527 | |
| oai:hal.inria.fr:inria-00452527 | |
| From: Frédéric Loulergue | |
| Submitted on: Tuesday, 2 February 2010 15:47:07 | |
| Updated on: Tuesday, 2 February 2010 15:47:07 | |