Divide-and-Conquer Programming with Minimally Synchronous Parallel ML - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Divide-and-Conquer Programming with Minimally Synchronous Parallel ML

Abstract

Minimally Synchronous Parallel ML (MSPML) is a functional parallel programming language. It is based on a small number of primitives on a parallel data structure. MSPML programs are written like usual sequential ML program and use this small set of functions. MSPML is deterministic and deadlock free. The execution time of the programs can be estimated. Divide-and-conquer is a natural way of expressing parallel algorithms. MSPML is a flat language: it is not possible to split the parallel machine in order to implement divide-and-conquer parallel algorithms. This paper presents an extension of MSPML to deal with this kind of algorithms: a parallel composition primitive.

Dates and versions

inria-00452537 , version 1 (02-02-2010)

Identifiers

Cite

Radia Benheddi, Frédéric Loulergue. Divide-and-Conquer Programming with Minimally Synchronous Parallel ML. Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), Workshop on Language-Based Parallel Programming Models, Sep 2007, Gdansk, Poland. pp.1078-1085, ⟨10.1007/978-3-540-68111-3_114⟩. ⟨inria-00452537⟩
44 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More