Results 1 
2 of
2
Parallel Constraint Programming over BSP Vectors
 BP 6759, F45067 Orleans Cedex 2
, 1999
"... We propose and motivate a new formalism for declarative parallel programming : constraint programming on vectors, whose positions are interpreted as explicit processes. We introduce the vector domain X based on an underlying domain X and propose a set of primitive constraints on this domain : sc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We propose and motivate a new formalism for declarative parallel programming : constraint programming on vectors, whose positions are interpreted as explicit processes. We introduce the vector domain X based on an underlying domain X and propose a set of primitive constraints on this domain : scalar predicates are extended pointwise while communication is modeled by the new global constraint = ? interpreted as a bulksynchronous communication phase. We present two families of complete solvers on this domain but show that their parallel implementation is troublesome. To avoid this problem we also introduce a family of more efficient but incomplete parallel solvers. The incomplete solvers are shown to support the declarative programming of dataparallel algorithms with explicit processes in the bulksynchronous parallelism (BSP) style which ensures reliable and predictable execution costs. 1 Introduction Writing a parallel program is a notoriously difficult task. Using C wit...
BSP Constraint Programming
, 2000
"... . We propose a new formalism for declarative parallel programming : constraint programming on vectors, whose positions are interpreted as explicit processes. We introduce the vector domain X based on an underlying domain X and propose a set of primitive constraints on this domain : scalar pred ..."
Abstract
 Add to MetaCart
. We propose a new formalism for declarative parallel programming : constraint programming on vectors, whose positions are interpreted as explicit processes. We introduce the vector domain X based on an underlying domain X and propose a set of primitive constraints on this domain : scalar predicates are extended pointwise while communication is modeled by the new global constraint = ? interpreted as a bulksynchronous communication phase. We present two complete solvers on this domain but show that their distributed implementation is troublesome. To avoid this problem we also introduce an incomplete but more ecient parallel solver. The incomplete solver is shown to support the declarative programming of dataparallel algorithms with explicit processes in the bulksynchronous parallelism (BSP) style which ensures reliable and predictable execution costs. 1 Introduction Writing a parallel program is a notoriously dicult task. Using C with a library like MPI [10] forces t...