Concurrent garbage collection for concurrent rewriting
Identifieur interne : 00C773 ( Main/Exploration ); précédent : 00C772; suivant : 00C774Concurrent garbage collection for concurrent rewriting
Auteurs : Ilies Alouini [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We describe an algorithm that achieves garbage collection when performing concurrent rewriting. We show how this algorithm follows the implementation model of concurrent graph rewriting. This model has been studied and directly implemented on MIMD machines where nodes of the graph are distributed over a set of processors. A distinguishing feature of our algorithm is that it collects garbage concurrently with the rewriting process. Furthermore, our garbage collection algorithm never blocks the process of rewriting; in particular it does not involve synchronisation primitives. In contrast to a classical garbage collection algorithm reclaiming unused blocks of memory, the presented algorithm collects active nodes of the graph (i.e. nodes are viewed as processes). Finally, we present different results of experimentations based on our implementation (RECO) of concurrent rewriting using the concurrent garbage collection algorithm and show that significant speed-ups can be obtained when computing normal forms of terms. Keywords: Concurrent rewriting, Graph rewriting, MIMD architectures, Concurrent garbage collection algorithms.
Url:
DOI: 10.1007/3-540-59200-8_53
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002030
- to stream Istex, to step Curation: 002004
- to stream Istex, to step Checkpoint: 002B88
- to stream Main, to step Merge: 00D030
- to stream Main, to step Curation: 00C773
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Concurrent garbage collection for concurrent rewriting</title><author><name sortKey="Alouini, Ilies" sort="Alouini, Ilies" uniqKey="Alouini I" first="Ilies" last="Alouini">Ilies Alouini</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8B5F7E4A03EE4478231BD7FA2E6E7EB44ED9D6BE</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1007/3-540-59200-8_53</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-DKRFJJLH-8/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002030</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002030</idno><idno type="wicri:Area/Istex/Curation">002004</idno><idno type="wicri:Area/Istex/Checkpoint">002B88</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002B88</idno><idno type="wicri:doubleKey">0302-9743:1995:Alouini I:concurrent:garbage:collection</idno><idno type="wicri:Area/Main/Merge">00D030</idno><idno type="wicri:Area/Main/Curation">00C773</idno><idno type="wicri:Area/Main/Exploration">00C773</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Concurrent garbage collection for concurrent rewriting</title><author><name sortKey="Alouini, Ilies" sort="Alouini, Ilies" uniqKey="Alouini I" first="Ilies" last="Alouini">Ilies Alouini</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 describe an algorithm that achieves garbage collection when performing concurrent rewriting. We show how this algorithm follows the implementation model of concurrent graph rewriting. This model has been studied and directly implemented on MIMD machines where nodes of the graph are distributed over a set of processors. A distinguishing feature of our algorithm is that it collects garbage concurrently with the rewriting process. Furthermore, our garbage collection algorithm never blocks the process of rewriting; in particular it does not involve synchronisation primitives. In contrast to a classical garbage collection algorithm reclaiming unused blocks of memory, the presented algorithm collects active nodes of the graph (i.e. nodes are viewed as processes). Finally, we present different results of experimentations based on our implementation (RECO) of concurrent rewriting using the concurrent garbage collection algorithm and show that significant speed-ups can be obtained when computing normal forms of terms. Keywords: Concurrent rewriting, Graph rewriting, MIMD architectures, Concurrent garbage collection algorithms.</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="Alouini, Ilies" sort="Alouini, Ilies" uniqKey="Alouini I" first="Ilies" last="Alouini">Ilies Alouini</name></region><name sortKey="Alouini, Ilies" sort="Alouini, Ilies" uniqKey="Alouini I" first="Ilies" last="Alouini">Ilies Alouini</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C773 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C773 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:8B5F7E4A03EE4478231BD7FA2E6E7EB44ED9D6BE
|texte= Concurrent garbage collection for concurrent rewriting
}}
| This area was generated with Dilib version V0.6.33. |  |