Minimally Synchronous Parallel ML with Parallel Composition - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

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.
No file

Dates and versions

hal-00022260 , version 1 (05-04-2006)

Identifiers

  • HAL Id : hal-00022260 , version 1

Cite

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⟩
50 View
0 Download

Share

Gmail Facebook X LinkedIn More