Cuts and side-effects in distributed memory OR-parallel prolog
Identifieur interne : 000A71 ( France/Analysis ); précédent : 000A70; suivant : 000A72Cuts and side-effects in distributed memory OR-parallel prolog
Auteurs : É. Morel [France] ; J. Briat [France] ; J. Chassin De Kergommeaux [France]Source :
- Parallel Computing [ 0167-8191 ] ; 1996.
Abstract
The aim of the logic programming system PloSys is to offer most Prolog functionalities on distributed memory parallel computers as well as networks of personal computers. The PloSys computational model exploits OR-parallelism. It is designed to implement cuts and side-effects while keeping the number of messages exchanged between processors low. It is a multi-sequential model based on copying. Scheduling is centralized as is the management of the Prolog cuts and side-effects. The scheduler keeps up to date the knowledge of the left-most worker in the scope of each cut. A PloSys prototype was implemented and its first results, on an IBM SP-1, are promising.
Url:
DOI: 10.1016/S0167-8191(96)00082-8
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F24
- to stream Istex, to step Curation: 000F24
- to stream Istex, to step Checkpoint: 000D69
- to stream Main, to step Merge: 002A71
- to stream Main, to step Curation: 002951
- to stream Main, to step Exploration: 002951
- to stream France, to step Extraction: 000A71
Links to Exploration step
ISTEX:ED6FC05614AD0DC48EC8446A88182E5E01586B96Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Cuts and side-effects in distributed memory OR-parallel prolog</title><author><name sortKey="Morel, E" sort="Morel, E" uniqKey="Morel E" first="É." last="Morel">É. Morel</name></author><author><name sortKey="Briat, J" sort="Briat, J" uniqKey="Briat J" first="J." last="Briat">J. Briat</name></author><author><name sortKey="De Kergommeaux, J Chassin" sort="De Kergommeaux, J Chassin" uniqKey="De Kergommeaux J" first="J. Chassin" last="De Kergommeaux">J. Chassin De Kergommeaux</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:ED6FC05614AD0DC48EC8446A88182E5E01586B96</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1016/S0167-8191(96)00082-8</idno><idno type="url">https://api.istex.fr/document/ED6FC05614AD0DC48EC8446A88182E5E01586B96/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000F24</idno><idno type="wicri:Area/Istex/Curation">000F24</idno><idno type="wicri:Area/Istex/Checkpoint">000D69</idno><idno type="wicri:doubleKey">0167-8191:1997:Morel E:cuts:and:side</idno><idno type="wicri:Area/Main/Merge">002A71</idno><idno type="wicri:Area/Main/Curation">002951</idno><idno type="wicri:Area/Main/Exploration">002951</idno><idno type="wicri:Area/France/Extraction">000A71</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Cuts and side-effects in distributed memory OR-parallel prolog</title><author><name sortKey="Morel, E" sort="Morel, E" uniqKey="Morel E" first="É." last="Morel">É. Morel</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9</wicri:regionArea><wicri:noRegion>Cedex 9</wicri:noRegion><wicri:noRegion>Cedex 9</wicri:noRegion></affiliation></author><author><name sortKey="Briat, J" sort="Briat, J" uniqKey="Briat J" first="J." last="Briat">J. Briat</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9</wicri:regionArea><wicri:noRegion>Cedex 9</wicri:noRegion><wicri:noRegion>Cedex 9</wicri:noRegion></affiliation></author><author><name sortKey="De Kergommeaux, J Chassin" sort="De Kergommeaux, J Chassin" uniqKey="De Kergommeaux J" first="J. Chassin" last="De Kergommeaux">J. Chassin De Kergommeaux</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9</wicri:regionArea><wicri:noRegion>Cedex 9</wicri:noRegion><wicri:noRegion>Cedex 9</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Parallel Computing</title><title level="j" type="abbrev">PARCO</title><idno type="ISSN">0167-8191</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1996">1996</date><biblScope unit="volume">22</biblScope><biblScope unit="issue">13</biblScope><biblScope unit="page" from="1883">1883</biblScope><biblScope unit="page" to="1896">1896</biblScope></imprint><idno type="ISSN">0167-8191</idno></series><idno type="istex">ED6FC05614AD0DC48EC8446A88182E5E01586B96</idno><idno type="DOI">10.1016/S0167-8191(96)00082-8</idno><idno type="PII">S0167-8191(96)00082-8</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-8191</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The aim of the logic programming system PloSys is to offer most Prolog functionalities on distributed memory parallel computers as well as networks of personal computers. The PloSys computational model exploits OR-parallelism. It is designed to implement cuts and side-effects while keeping the number of messages exchanged between processors low. It is a multi-sequential model based on copying. Scheduling is centralized as is the management of the Prolog cuts and side-effects. The scheduler keeps up to date the knowledge of the left-most worker in the scope of each cut. A PloSys prototype was implemented and its first results, on an IBM SP-1, are promising.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Morel, E" sort="Morel, E" uniqKey="Morel E" first="É." last="Morel">É. Morel</name></noRegion><name sortKey="Briat, J" sort="Briat, J" uniqKey="Briat J" first="J." last="Briat">J. Briat</name><name sortKey="De Kergommeaux, J Chassin" sort="De Kergommeaux, J Chassin" uniqKey="De Kergommeaux J" first="J. Chassin" last="De Kergommeaux">J. Chassin De Kergommeaux</name><name sortKey="De Kergommeaux, J Chassin" sort="De Kergommeaux, J Chassin" uniqKey="De Kergommeaux J" first="J. Chassin" last="De Kergommeaux">J. Chassin De Kergommeaux</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A71 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000A71 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= OperaV1
|flux= France
|étape= Analysis
|type= RBID
|clé= ISTEX:ED6FC05614AD0DC48EC8446A88182E5E01586B96
|texte= Cuts and side-effects in distributed memory OR-parallel prolog
}}
| This area was generated with Dilib version V0.6.21. |  |