InforLorV4, Main, Merge, bibRecord, 00C979

Fine-grained concurrent completion

Identifieur interne : 00C979 ( Main/Merge ); précédent : 00C978; suivant : 00C980

Fine-grained concurrent completion

Auteurs : C. Kirchner [France] ; C. Lynch [France] ; C. Scharff [France]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 1996.

RBID : Pascal:96-0480364

Descripteurs français

Pascal (Inist)
- Coopération, Processus, Simultanéité informatique, Théorie graphe, Parallélisme, Réécriture, Partage, Asynchrone.

English descriptors

KwdEn :
- Asynchronous, Concurrency, Cooperation, Graph theory, Parallelism, Process, Rewriting, Sharing.

Abstract

We present a concurrent Completion procedure based on the use of a SOUR graph as data structure. The procedure has the following characteristics. It is asynchronous, there is no need for a global memory or global control, equations are stored in a SOUR graph with maximal structure sharing, and each vertex is a process, representing a term. Therefore, the parallelism is at the term level. Each edge is a communication link, representing a (subterm, ordering, unification or rewrite) relation between terms. Completion is performed on the graph as local graph transformations by cooperation between processes. We show that this concurrent Completion procedure is sound and complete with respect to the sequential one, provided that the information is locally time stamped in order to detect out of date information.

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000D23
to stream PascalFrancis, to step Curation: 000B68
to stream PascalFrancis, to step Checkpoint: 000C92

Links to Exploration step

Pascal:96-0480364

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Fine-grained concurrent completion</title>
<author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Scharff, C" sort="Scharff, C" uniqKey="Scharff C" first="C." last="Scharff">C. Scharff</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">96-0480364</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 96-0480364 INIST</idno>
<idno type="RBID">Pascal:96-0480364</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000D23</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000B68</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000C92</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C92</idno>
<idno type="wicri:doubleKey">0302-9743:1996:Kirchner C:fine:grained:concurrent</idno>
<idno type="wicri:Area/Main/Merge">00C979</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Fine-grained concurrent completion</title>
<author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Scharff, C" sort="Scharff, C" uniqKey="Scharff C" first="C." last="Scharff">C. Scharff</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1996">1996</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Asynchronous</term>
<term>Concurrency</term>
<term>Cooperation</term>
<term>Graph theory</term>
<term>Parallelism</term>
<term>Process</term>
<term>Rewriting</term>
<term>Sharing</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Coopération</term>
<term>Processus</term>
<term>Simultanéité informatique</term>
<term>Théorie graphe</term>
<term>Parallélisme</term>
<term>Réécriture</term>
<term>Partage</term>
<term>Asynchrone</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We present a concurrent Completion procedure based on the use of a SOUR graph as data structure. The procedure has the following characteristics. It is asynchronous, there is no need for a global memory or global control, equations are stored in a SOUR graph with maximal structure sharing, and each vertex is a process, representing a term. Therefore, the parallelism is at the term level. Each edge is a communication link, representing a (subterm, ordering, unification or rewrite) relation between terms. Completion is performed on the graph as local graph transformations by cooperation between processes. We show that this concurrent Completion procedure is sound and complete with respect to the sequential one, provided that the information is locally time stamped in order to detect out of date information.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Villers-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
</region>
<name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name>
<name sortKey="Scharff, C" sort="Scharff, C" uniqKey="Scharff C" first="C." last="Scharff">C. Scharff</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C979 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C979 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     Pascal:96-0480364
   |texte=   Fine-grained concurrent completion
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Fine-grained concurrent completion

Fine-grained concurrent completion

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri