Results 1 
9 of
9
Semantics of Minimally Synchronous Parallel ML
 4th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD’03
, 2003
"... This paper presents a new functional parallel language: Minimally Synchronous Parallel ML. The execution time can then be estimated and deadlocks and indeterminism are avoided. It shares with Bulk Synchronous Parallel ML its syntax and highlevel semantics but it has a minimally synchronous distrib ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
This paper presents a new functional parallel language: Minimally Synchronous Parallel ML. The execution time can then be estimated and deadlocks and indeterminism are avoided. It shares with Bulk Synchronous Parallel ML its syntax and highlevel semantics but it has a minimally synchronous distributed semantics. Programs are written as usual ML programs but using a small set of additional functions. Provided functions are used to access the parameters of the parallel machine and to create and operate on a parallel data structure. It follows the cost model of the Message Passing Machine model (MPM). 1.
A Tutorial Implementation of the Diffusion Algorithmic Skeleton with the BSMLlib Library
, 2004
"... Skeleton programming enables programmers to build parallel programs easier by providing efficient readymade parallel algorithms. The diffusion skeleton was proposed (associated with a method for program derivation) to abstract a good combination of primitive skeletons, such as map, parallel red ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Skeleton programming enables programmers to build parallel programs easier by providing efficient readymade parallel algorithms. The diffusion skeleton was proposed (associated with a method for program derivation) to abstract a good combination of primitive skeletons, such as map, parallel reduction and parallel prefix sum (scan).
A Conservative Scheme for Parallel Interval Narrowing
 Information Processing Letters
, 2000
"... An e#cient parallel interval narrowing algorithm for solving numerical problems is designed, implemented and tested. Di#erences with the corresponding sequential algorithm are clearly stated. The algorithm's performance is analyzed in the BulkSynchronous Parallel (BSP) cost model which suggest ..."
Abstract
 Add to MetaCart
An e#cient parallel interval narrowing algorithm for solving numerical problems is designed, implemented and tested. Di#erences with the corresponding sequential algorithm are clearly stated. The algorithm's performance is analyzed in the BulkSynchronous Parallel (BSP) cost model which suggests speedups on highbandwidth architectures. Experimental results on a massively parallel machine Cray T3E1200 validate the model and show the parallel algorithm's e#ciency as well as its limitations. Key words: parallel algorithms, numerical algorithms, interval narrowing, constraint propagation, BSP model. Appears in: Information Processing Letters, 74(34):141146, 2000. Elsevier Science. 1 Introduction Parallel processing of numerical problems via interval constraints has been proposed as a general framework for highperformance numerical computation in [5]. Its two potential advantages over classical methods are 1. the guarantee of numerically correct answers through interval arithme...
unknown title
"... This paper presents a new functional parallel language: Minimally Synchronous Parallel ML (MSPML). The execution time can be estimated, deadlocks and indeterminism are avoided. Programs are written as usual ML programs but using a small set of additional functions. Provided functions are used to ac ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents a new functional parallel language: Minimally Synchronous Parallel ML (MSPML). The execution time can be estimated, deadlocks and indeterminism are avoided. Programs are written as usual ML programs but using a small set of additional functions. Provided functions are used to access the parameters of the parallel machine and to create and operate on a parallel data structure. It follows the execution and cost model of the Message Passing Machine model (MPM). It shares with Bulk Synchronous Parallel ML its syntax and highlevel semantics but it has a minimally synchronous distributed semantics. Experiments have been run on a cluster of PC using an implementation of the Diffusion algorithmic skeleton.
Pattern Matching and Exception Handling for Bulk Synchronous Parallel ML
, 2003
"... The BSML (Bulk Synchronous ML) language is a dataparallel functional language for programming BSP (Bulk Synchronous algorithms) algorithms in socalled direct mode. In a direct mode BSP algorithm, the physical structure of processes is made explicit. The execution time can then be estimated and dea ..."
Abstract
 Add to MetaCart
The BSML (Bulk Synchronous ML) language is a dataparallel functional language for programming BSP (Bulk Synchronous algorithms) algorithms in socalled direct mode. In a direct mode BSP algorithm, the physical structure of processes is made explicit. The execution time can then be estimated and deadlocks and indeterminism are avoided. The BSMLlib library, the current implementation of the BSML language, permits, as an extension of Objective Caml, the use of the exceptions handling mechanism that comes with this language. However, the interaction of Objective Caml exceptions with the BS#calculus (the theoretical model underlying the BSML language) has not yet been studied and yields some safety issues. In particular, the use of collective synchronization operations needs the participation of all processes during the call to one of these operation, should the opposite occur, processes involved in this call are locked. The BSML language, without exceptions, ensures that all processes participate to such a call and thus that deadlocks are avoided (except for process failure). When one introduces Objective Caml exceptions, this safety property does not hold any more. Thus it is needed to study a new semantics, suitable to exceptions handling, to recover this property. The present work introduces such a semantics in which the participation of all processes is ensured and deadlock issues are avoided. We will also introduce a semantics allowing the patternmatching of BSML parallel vectors. This semantics has been studied in the framework of a previous work on exceptions handling which has not been retained here but its functionalities will be nethertheless add to the BSML language.
Verifying Functional Bulk Synchronous Parallel Programs Using the Coq System
, 2003
"... The Bulk Synchronous Parallel ML (BSML) is a functional language for Bulk Synchronous Parallel (BSP) programming. It is based on an extension of the #calculus by parallel operations on a parallel data structure named parallel vector, which is given by intention. We present the formal proofs of c ..."
Abstract
 Add to MetaCart
(Show Context)
The Bulk Synchronous Parallel ML (BSML) is a functional language for Bulk Synchronous Parallel (BSP) programming. It is based on an extension of the #calculus by parallel operations on a parallel data structure named parallel vector, which is given by intention. We present the formal proofs of correctness of BSML programs in the Coq proof assistant. Such development demonstrates the usefulness of higherorder logic in the process of software certification and parallel applications. They also show that proof of rather complex parallel algorithms may be made with inductive types by using the certified programs.
Contents
, 2004
"... 1.1 The BSP Model............................................ 4 1.2 Explicit processes and the SPMD programming style....................... 5 1.3 Overview of the core BSMLlib library................................ 6 ..."
Abstract
 Add to MetaCart
(Show Context)
1.1 The BSP Model............................................ 4 1.2 Explicit processes and the SPMD programming style....................... 5 1.3 Overview of the core BSMLlib library................................ 6