Minimally Synchronous Parallel ML with Parallel Composition

Abstract : Parallel divide-and-conquer parallel algorithms are very common in the litterature on parallel algorithms. In order to ease their implementation in Minimally Synchronous Parallel ML (MSPML), we add a new primitive to this asynchronous parallel functional language. MSPML is based on a parallel data structure called parallel vectors and operations to manipulate them. This paper presents semantics and an implementation of MSPML with parallel composition.
Document type :
Conference papers
Complete list of metadatas
Contributor : Frédéric Loulergue <>
Submitted on : Wednesday, April 5, 2006 - 3:40:01 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM


  • HAL Id : hal-00022260, version 1



Radia Benheddi, Frédéric Loulergue. Minimally Synchronous Parallel ML with Parallel Composition. Seventh Symposium on Trends in Functional Programming (TFP 2006), 2006, United Kingdom. ⟨hal-00022260⟩



Record views