Results 1  10
of
19
Simple Parallel Statistical Computing in R
 Journal of Computational and Graphical Statistics
, 2007
"... Copyright c○2003 by the authors. Simple Parallel Statistical Computing in R Theoretically, many modern statistical procedures are trivial to parallelize. However, practical deployment of a parallelized implementation which is robust and reliably runs on different computational cluster configurations ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Copyright c○2003 by the authors. Simple Parallel Statistical Computing in R Theoretically, many modern statistical procedures are trivial to parallelize. However, practical deployment of a parallelized implementation which is robust and reliably runs on different computational cluster configurations and environments is far from trivial. We present a framework for the R statistical computing language that provides a simple yet powerful programming interface to a computational cluster. This interface allows the development of R functions that distribute independent computations across the nodes of the computational cluster. The resulting framework allows statisticians to obtain significant speedups for some computations at little additional development cost. The particular Modern computer processors are now sufficiently powerful to make many statistical computations seem instantaneous. However, important situations still exist where a single result can require days to compute.
Parallel Superposition for Bulk Synchronous Parallel ML
, 2003
"... The BSMLlib is a library for Bulk Synchronous Parallel programming with the functional language Objective Caml. It is based on an extension of the lcalculus by parallel operations on a parallel data structure named parallel vector, which is given by intention. ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
The BSMLlib is a library for Bulk Synchronous Parallel programming with the functional language Objective Caml. It is based on an extension of the lcalculus by parallel operations on a parallel data structure named parallel vector, which is given by intention.
Parallel Juxtaposition for Bulk Synchronous Parallel ML
 EuroPar 2003, number 2790 in LNCS
, 2002
"... The BSMLlib is a library for Bulk Synchronous Parallel (BSP) programming with the functional language Objective Caml. 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. ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
The BSMLlib is a library for Bulk Synchronous Parallel (BSP) programming with the functional language Objective Caml. 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.
A Parallel Virtual Machine for Bulk Synchronous Parallel ML
, 2003
"... Machine [8] (ZAM) which is the virtual machine used in the implementations of the Objective Caml [10] and Camllight languages and which is very efficient. ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Machine [8] (ZAM) which is the virtual machine used in the implementations of the Objective Caml [10] and Camllight languages and which is very efficient.
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
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
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 Parallel Categorical Abstract Machine for Bulk Synchronous Parallel ML
"... We have designed a functional dataparallel language called BSML for programming bulksynchronous parallel (BSP) algorithms in socalled direct mode. In a directmode BSP algorithm, the physical structure of processes is made explicit. The execution time can then be estimated and deadlocks and indet ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We have designed a functional dataparallel language called BSML for programming bulksynchronous parallel (BSP) algorithms in socalled direct mode. In a directmode 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 has been implemented for the Objective Caml language. But there is currently no full implementation of such a language and an abstract machine is needed to have a certified implementation. Our approach is based on a bytecode compilation to a parallel abstract machine performing exchange of data and synchronous requests derived from the abstract machine of the Caml language. 1.
The Status of NonMandatory Directives
, 2003
"... 1 Introduction The primary motivation for parallel programming is efficiency at execution (in terms of execution time). The problem with parallel programming is that parallel execution 1email: ..."
Abstract
 Add to MetaCart
1 Introduction The primary motivation for parallel programming is efficiency at execution (in terms of execution time). The problem with parallel programming is that parallel execution 1email:
Implementation of the BSMLlib Library v0.2
, 2002
"... The BSMLlib is a library for Bulk Synchronous Parallel (BSP) programming with the functional language Objective Caml. It is based on an extension of the #calcul by parallel operations on a parallel data structure named parallel vector, which is given by intention. A first implementation of this ..."
Abstract
 Add to MetaCart
The BSMLlib is a library for Bulk Synchronous Parallel (BSP) programming with the functional language Objective Caml. It is based on an extension of the #calcul by parallel operations on a parallel data structure named parallel vector, which is given by intention. A first implementation of this library was based on the BSPlib library, which is not longer supported nor updated. Being the basis of a framework for Grid computing, a new implementation of the BSMLlib based on MPI has been designed. Experimental results on a cluster of PCs are presented.
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
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.