Fine-grained concurrent completion
Identifieur interne :
000D23 ( PascalFrancis/Corpus );
précédent :
000D22;
suivant :
000D24
Fine-grained concurrent completion
Auteurs : C. Kirchner ;
C. Lynch ;
C. ScharffSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 1996.
RBID : Pascal:96-0480364
Descripteurs français
English descriptors
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.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1103 |
|---|
| A08 | 01 | 1 | ENG | @1 Fine-grained concurrent completion |
|---|
| A09 | 01 | 1 | ENG | @1 RTA-96 : rewriting techniques and applications : New Brunswick NJ, July 27-30, 1996 |
|---|
| A11 | 01 | 1 | | @1 KIRCHNER (C.) |
|---|
| A11 | 02 | 1 | | @1 LYNCH (C.) |
|---|
| A11 | 03 | 1 | | @1 SCHARFF (C.) |
|---|
| A12 | 01 | 1 | | @1 GANZINGER (Harald) @9 ed. |
|---|
| A14 | 01 | | | @1 INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 3-17 |
|---|
| A21 | | | | @1 1996 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000060633830010 |
|---|
| A44 | | | | @0 0000 @1 © 1996 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 15 ref. |
|---|
| A47 | 01 | 1 | | @0 96-0480364 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| A66 | 02 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 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. |
|---|
| C02 | 01 | X | | @0 001D02A06 |
|---|
| C02 | 02 | X | | @0 001D02B04 |
|---|
| C03 | 01 | X | FRE | @0 Coopération @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Cooperation @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Cooperación @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Processus @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Process @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Proceso @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Simultanéité informatique @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Concurrency @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Simultaneidad informatica @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Théorie graphe @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Graph theory @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Teoría grafo @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Parallélisme @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Parallelism @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Paralelismo @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Réécriture @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Rewriting @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Reescritura @5 06 |
|---|
| C03 | 07 | X | FRE | @0 Partage @5 07 |
|---|
| C03 | 07 | X | ENG | @0 Sharing @5 07 |
|---|
| C03 | 07 | X | SPA | @0 Partición @5 07 |
|---|
| C03 | 08 | X | FRE | @0 Asynchrone @5 08 |
|---|
| C03 | 08 | X | ENG | @0 Asynchronous @5 08 |
|---|
| C03 | 08 | X | SPA | @0 Asincrono @5 08 |
|---|
| N21 | | | | @1 330 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Rewriting techniques and applications. International conference @2 7 @3 New Brunswick NJ USA @4 1996-07-27 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 96-0480364 INIST |
|---|
| ET : | Fine-grained concurrent completion |
|---|
| AU : | KIRCHNER (C.); LYNCH (C.); SCHARFF (C.); GANZINGER (Harald) |
|---|
| AF : | INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut., 2 aut., 3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1103; Pp. 3-17; Bibl. 15 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | 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. |
|---|
| CC : | 001D02A06; 001D02B04 |
|---|
| FD : | Coopération; Processus; Simultanéité informatique; Théorie graphe; Parallélisme; Réécriture; Partage; Asynchrone |
|---|
| ED : | Cooperation; Process; Concurrency; Graph theory; Parallelism; Rewriting; Sharing; Asynchronous |
|---|
| SD : | Cooperación; Proceso; Simultaneidad informatica; Teoría grafo; Paralelismo; Reescritura; Partición; Asincrono |
|---|
| LO : | INIST-16343.354000060633830010 |
|---|
| ID : | 96-0480364 |
|---|
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><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><author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name>
<affiliation><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><author><name sortKey="Scharff, C" sort="Scharff, C" uniqKey="Scharff C" first="C." last="Scharff">C. Scharff</name>
<affiliation><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><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>
</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><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><author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name>
<affiliation><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><author><name sortKey="Scharff, C" sort="Scharff, C" uniqKey="Scharff C" first="C." last="Scharff">C. Scharff</name>
<affiliation><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><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><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><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><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><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1103</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Fine-grained concurrent completion</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>RTA-96 : rewriting techniques and applications : New Brunswick NJ, July 27-30, 1996</s1>
</fA09><fA11 i1="01" i2="1"><s1>KIRCHNER (C.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>LYNCH (C.)</s1>
</fA11><fA11 i1="03" i2="1"><s1>SCHARFF (C.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>GANZINGER (Harald)</s1>
<s9>ed.</s9>
</fA12><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>
</fA14><fA20><s1>3-17</s1>
</fA20><fA21><s1>1996</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000060633830010</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1996 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>15 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>96-0480364</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fA66 i1="02"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A06</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02B04</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Coopération</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Cooperation</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Cooperación</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Processus</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Process</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Proceso</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Simultanéité informatique</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Concurrency</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Simultaneidad informatica</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Théorie graphe</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Graph theory</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Teoría grafo</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Parallélisme</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Parallelism</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Paralelismo</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>06</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Partage</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Sharing</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Partición</s0>
<s5>07</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Asynchrone</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Asynchronous</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Asincrono</s0>
<s5>08</s5>
</fC03><fN21><s1>330</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Rewriting techniques and applications. International conference</s1>
<s2>7</s2>
<s3>New Brunswick NJ USA</s3>
<s4>1996-07-27</s4>
</fA30><server><NO>PASCAL 96-0480364 INIST</NO>
<ET>Fine-grained concurrent completion</ET>
<AU>KIRCHNER (C.); LYNCH (C.); SCHARFF (C.); GANZINGER (Harald)</AU>
<AF>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1103; Pp. 3-17; Bibl. 15 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D02A06; 001D02B04</CC>
<FD>Coopération; Processus; Simultanéité informatique; Théorie graphe; Parallélisme; Réécriture; Partage; Asynchrone</FD>
<ED>Cooperation; Process; Concurrency; Graph theory; Parallelism; Rewriting; Sharing; Asynchronous</ED>
<SD>Cooperación; Proceso; Simultaneidad informatica; Teoría grafo; Paralelismo; Reescritura; Partición; Asincrono</SD>
<LO>INIST-16343.354000060633830010</LO>
<ID>96-0480364</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D23 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000D23 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|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 |  |
