Results 1 
4 of
4
Semantics of a dataparallel logic language using the BSP execution model
, 1998
"... We present a parallel logic language which uses the bulk synchronous parallelism (BSP) execution model [13]. The BSP model provides a simple way to program parallel machines by restricting the SPMD style : processes are limited to a bounded asynchronism during local computations and communication is ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present a parallel logic language which uses the bulk synchronous parallelism (BSP) execution model [13]. The BSP model provides a simple way to program parallel machines by restricting the SPMD style : processes are limited to a bounded asynchronism during local computations and communication is a global operation followed by a global synchronization. This in conjunction with explicit location provides a simple cost model that allow performance prediction. We adapt the dataparallel logic language DPlog [7] to fit with theses characteristics and we present both a declarative and an operational semantics. The resulting language, we call BSDPlog, offers a great expressive power without any compromise to the advantages of BSP. Keywords: Parallel Logic Programming, Semantics, BSP model 1 Introduction We propose a parallel logic language called BSDPlog which uses the Bulk Synchronous Parallelism (BSP) execution model. It aims to inherits from logic programming a declarative semantic...
Contribution to the Design and the Semantics of a DataParallel Logic Programming Language
, 1995
"... . We propose an alternate approach to the usual introduction of parallelism in logic programming. Instead of detecting the intrinsic parallelism by an automatic and complex dataflow analysis, or upgrading standard logic languages by explicit concurrent control structures leading to taskoriented la ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We propose an alternate approach to the usual introduction of parallelism in logic programming. Instead of detecting the intrinsic parallelism by an automatic and complex dataflow analysis, or upgrading standard logic languages by explicit concurrent control structures leading to taskoriented languages, we tightly integrate the concepts of the dataparallel programming model and of logic programming in a kernel language, called DPLog. It offers a simple centralized and synchronous vision to the programmer. We give this language a declarative and a distributed asynchronous operational semantics. The equivalence theorem of these semantics establishes the soundness of the implementation. The expressiveness of the language is illustrated on examples. This document is an extended version of [18] which incorporates a missing proof. R'esum'e. Nous proposons une alternative aux approches classiques de l'introduction du parall'elisme en programmation logique. Au lieu de d'etecter le parall...
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...