Detecting interference through graph reduction
Identifieur interne : 00BA52 ( Main/Curation ); précédent : 00BA51; suivant : 00BA53Detecting interference through graph reduction
Auteurs : Denis RoegelSource :
English descriptors
- KwdEn :
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.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001E53
- to stream Crin, to step Curation: Pour aller vers cette notice dans l'étape Curation :001E53
- to stream Crin, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :002775
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00C229
Links to Exploration step
CRIN:roegel97dLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="201">Detecting interference through graph reduction</title></titleStmt><publicationStmt><idno type="RBID">CRIN:roegel97d</idno><date when="1997" year="1997">1997</date><idno type="wicri:Area/Crin/Corpus">001E53</idno><idno type="wicri:Area/Crin/Curation">001E53</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001E53</idno><idno type="wicri:Area/Crin/Checkpoint">002775</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002775</idno><idno type="wicri:Area/Main/Merge">00C229</idno><idno type="wicri:Area/Main/Curation">00BA52</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Detecting interference through graph reduction</title><author><name sortKey="Roegel, Denis" sort="Roegel, Denis" uniqKey="Roegel D" first="Denis" last="Roegel">Denis Roegel</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>TLA</term><term>concurrency</term><term>graphs</term><term>interferences</term><term>nets</term><term>reduction</term><term>rewriting</term><term>threads</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1069">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.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00BA52 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 00BA52 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Curation
|type= RBID
|clé= CRIN:roegel97d
|texte= Detecting interference through graph reduction
}}
| This area was generated with Dilib version V0.6.33. |  |