Bulk synchronous parallel ML with exceptions

  • Authors:
  • Louis Gesbert;Frédéric Gava;Frédéric Loulergue;Frédéric Dabrowski

  • Affiliations:
  • Laboratory of Algorithms, Complexity and Logic, University Paris XII, France;Laboratory of Algorithms, Complexity and Logic, University Paris XII, France;Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans, France;Institut de Recherche en Informatique et Automatique, Sophia-Antipolis, France

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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, indeterminism). 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.