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

Abstract : 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 tex-tual 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02162234
Contributor : Wadoud Bousdira <>
Submitted on : Friday, June 21, 2019 - 3:30:25 PM
Last modification on : Tuesday, July 16, 2019 - 8:43:32 PM

Files

article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02162234, version 1

Collections

Citation

Wadoud Bousdira. Transforming non textually aligned SPMD programs into textually aligned SPMD programs by using rewriting rules. International Conference on High Performance Computing & Simulation, Jul 2019, Dublin, Ireland. ⟨hal-02162234⟩

Share

Metrics

Record views

24

Files downloads

9