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.
Type de document :
Communication dans un congrès
Weglarz, J. and Wyrzykowski, R. and Szymanski, B. Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), Workshop on Language-Based Parallel Programming Models, Sep 2007, Gdansk, Poland. Springer, 4967, pp.1078-1085, 2008, LNCS. 〈10.1007/978-3-540-68111-3_114〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00452537
Contributeur : Frédéric Loulergue <>
Soumis le : mardi 2 février 2010 - 15:54:04
Dernière modification le : mercredi 29 novembre 2017 - 10:19:37

Identifiants

Collections

Citation

Radia Benheddi, Frédéric Loulergue. Divide-and-Conquer Programming with Minimally Synchronous Parallel ML. Weglarz, J. and Wyrzykowski, R. and Szymanski, B. Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), Workshop on Language-Based Parallel Programming Models, Sep 2007, Gdansk, Poland. Springer, 4967, pp.1078-1085, 2008, LNCS. 〈10.1007/978-3-540-68111-3_114〉. 〈inria-00452537〉

Partager

Métriques

Consultations de la notice

58