Divide-and-conquer parallel programming with minimally synchronous parallel ML

Authors:
Radia Benheddi;Frédéric Loulergue
Affiliations:
LIFO, University of Orléans, France;LIFO, University of Orléans, France
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 6
Cited 0

A bridging model for parallel computation

Communications of the ACM
Algorithmic skeletons: structured management of parallel computation

Algorithmic skeletons: structured management of parallel computation
Implementation of a portable nested data-parallel language

Journal of Parallel and Distributed Computing - Special issue on data parallel algorithms and programming
Structured development of parallel programs

Structured development of parallel programs
A structured synchronization and communication model fitting irregular data accesses

Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
Bulk synchronous parallel ML: modular implementation and performance prediction

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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.