Detecting interference through graph reduction - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 1997

Detecting interference through graph reduction

(1)
1

Abstract

Parallel programs which run in a shared-memory model have several threads that may interfere. There are constraints between the threads and these constraints can be modelled by a net. We present TLA nets, which are interesting for the representation of concurrent executions. A reduction operation is defined on these nets, in order to detect interferences. These interferences can be eliminated by adding components such as delays to the net. TLA nets are a graphical tool to explore the constraints of parallel programming.
Fichier principal
Vignette du fichier
roegel1997reducibility.pdf (117.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02435522 , version 1 (10-01-2020)

Identifiers

  • HAL Id : hal-02435522 , version 1

Cite

Denis Roegel. Detecting interference through graph reduction. [Research Report] Loria & Inria Grand Est. 1997. ⟨hal-02435522⟩
13 View
6 Download

Share

Gmail Facebook Twitter LinkedIn More