Formal Semantics of a Subset of the Paderborn's BSPlib

Gava, Frédéric; Fortin, J. A.

doi:10.1109/pdcat.2008.43

Cited by 9 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…⇓ ∞ and ⇒ ∞ hp ) are equivalent for programs that do not used high-performance routines. Programs that have been proved correct using the natural semantics [11] are also correct if we executed them in a high-performance environment.…”

Section: Now We Have Following Lemmasmentioning

confidence: 97%

“…The inductive s m a l l s t e p s e m l defines a local reduction, that is execution of a communication routine or execution of a sequential control flow. We give here an interesting part of its Coq's definition: ( * I f t h e n e l s e s e m a n t i c s * ) | s m a l l s t e p s e m i f e l s e t r u e : ∀ e i 1 i 2 l 1 l 1 ' , ∀i · · · ni, Ei, Ci, Ri, skip · · · ⇒ · · · ni, Ei, Ci, Ri, skip · · · ∀i · · · ni, Ei, Ci, Ri, ci · · · ⇀ · · · n ′ i , We previously defined [11] (also in Coq) a natural semantics of the same PUB subset. This semantics has been proved (also using Coq) to be deterministic and we thus have the following lemmas by induction/co-induction:…”

Section: Coq Development and Lemmasmentioning

confidence: 99%

“…In [11], we presented a formal deterministic operational semantics (a natural semantics) for BSP programs and used it to prove the correctness of a classical numerical computation (the N-body problem which is considered to be an important Dwarf [3]) and the divergence of some programs.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Two Formal Semantics of a Subset of the Paderborn University BSPlib

Gava

Fortin

2009

2009 17th Euromicro International Conference on Parallel, Distributed and Network-Based Processing

Self Cite

View full text Add to dashboard Cite

PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP)algorithms. The BSP model allows an estimation of the execution time, avoids deadlocks and non-determinism. This paper presents two formal operational semantics for a C+PUB subset language using the Coq proof assistant, one for classical BSP operations and one that emphasises high performance primitives.

show abstract

Section: Now We Have Following Lemmasmentioning

confidence: 97%

Section: Coq Development and Lemmasmentioning

confidence: 99%

See 1 more Smart Citation

Two Formal Semantics of a Subset of the Paderborn University BSPlib

Gava

Fortin

2009

2009 17th Euromicro International Conference on Parallel, Distributed and Network-Based Processing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Using subset synchronization to coordinate different BSP algorithms in the same system seems possible but even more error prone. Formal semantics were defined for BSPlib DRMA [15] and the PUB library [9].…”

Section: Bulk Synchronous Parallelmentioning

confidence: 99%

Active Objects for Coordinating BSP Computations (Short Paper)

Hains¹,

Henrio²,

Leca³

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Among the programming models for parallel and distributed computing, one can identify two important families. The programming models adapted to data-parallelism, where a set of coordinated processes perform a computation by splitting the input data; and coordination languages able to express complex coordination patterns and rich interactions between processing entities. This article takes two successful programming models belonging to the two categories and puts them together into an effective programming model. More precisely, we investigate the use of active objects to coordinate BSP processes. We choose two paradigms that both enforce the absence of data-races, one of the major sources of error in parallel programming. This article explains why we believe such a model is interesting and provides a formal semantics integrating the notions of the two programming paradigms in a coherent and effective manner.

show abstract

“…formalize BSPlib [26] and Gava and al. formalize Paderborn's BSPlib [15]. As far as we know, the only contribution that proposes a denotational semantics which gives meaning exactly to programs with textual alignment is in [8].…”

Section: Introductionmentioning

confidence: 99%

Transforming non textually aligned SPMD programs into textually aligned SPMD programs by using rewriting rules

Bousdira

2019

2019 International Conference on High Performance Computing &Amp; Simulation (HPCS)

View full text Add to dashboard Cite

The problem of analyzing parallel programs that access shared memory and use barrier synchronization is known to be hard to study. For a special case of those programs with minimal SPMD (Single Program Multiple Data) constructs, a formal definition of textually aligned barriers with an operational semantics has been proposed in previous work. Then, the textual alignement of the synchronization barriers that is defined prevents deadlocks. However, the textual alignement property is not verified by all SPMD programs. We propose a set of transformation rules using rewriting techniques which allows to turn a non-textually aligned program to be textually aligned. So, we can benefit of a simple static analysis for deadlock detection. We show that the rewrite rules form a terminating confluent system and we prove that the transformation rules preserve the semantics of the programs.

show abstract

Formal Semantics of a Subset of the Paderborn's BSPlib

Cited by 9 publications

References 19 publications

Two Formal Semantics of a Subset of the Paderborn University BSPlib

Two Formal Semantics of a Subset of the Paderborn University BSPlib

Active Objects for Coordinating BSP Computations (Short Paper)

Transforming non textually aligned SPMD programs into textually aligned SPMD programs by using rewriting rules

Contact Info

Product

Resources

About