Fine-grained concurrent completion
Identifieur interne : 00C888 ( Main/Merge ); précédent : 00C887; suivant : 00C889Fine-grained concurrent completion
Auteurs : Claude Kirchner [France] ; Christopher Lynch [France] ; Christelle Scharff [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
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.
Url:
DOI: 10.1007/3-540-61464-8_39
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001874
- to stream Istex, to step Curation: 001855
- to stream Istex, to step Checkpoint: 002968
Links to Exploration step
ISTEX:6A32FD64AFE2E7C3B52F7C27A36616CB1982B4A7Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Fine-grained concurrent completion</title><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name></author><author><name sortKey="Scharff, Christelle" sort="Scharff, Christelle" uniqKey="Scharff C" first="Christelle" last="Scharff">Christelle Scharff</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6A32FD64AFE2E7C3B52F7C27A36616CB1982B4A7</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/3-540-61464-8_39</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-607B7DDV-T/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001874</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001874</idno><idno type="wicri:Area/Istex/Curation">001855</idno><idno type="wicri:Area/Istex/Checkpoint">002968</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002968</idno><idno type="wicri:doubleKey">0302-9743:1996:Kirchner C:fine:grained:concurrent</idno><idno type="wicri:Area/Main/Merge">00C888</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Fine-grained concurrent completion</title><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea><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><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea><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><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Scharff, Christelle" sort="Scharff, Christelle" uniqKey="Scharff C" first="Christelle" last="Scharff">Christelle Scharff</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INRIA Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea><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><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI></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 00C888 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C888 | 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é= ISTEX:6A32FD64AFE2E7C3B52F7C27A36616CB1982B4A7
|texte= Fine-grained concurrent completion
}}
| This area was generated with Dilib version V0.6.33. |  |