Cuts and side-effects in distributed memory OR-parallel prolog
Identifieur interne : 000F24 ( Istex/Corpus ); précédent : 000F23; suivant : 000F25Cuts and side-effects in distributed memory OR-parallel prolog
Auteurs : É. Morel ; J. Briat ; J. Chassin De KergommeauxSource :
- 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
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><affiliation><mods:affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</mods:affiliation></affiliation></author><author><name sortKey="Briat, J" sort="Briat, J" uniqKey="Briat J" first="J." last="Briat">J. Briat</name><affiliation><mods:affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</mods:affiliation></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><mods:affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jacques.chassin-de-kergommeaux@imag.fr</mods:affiliation></affiliation></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></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><mods:affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</mods:affiliation></affiliation></author><author><name sortKey="Briat, J" sort="Briat, J" uniqKey="Briat J" first="J." last="Briat">J. Briat</name><affiliation><mods:affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</mods:affiliation></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><mods:affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jacques.chassin-de-kergommeaux@imag.fr</mods:affiliation></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><istex><corpusName>elsevier</corpusName><author><json:item><name>É. Morel</name><affiliations><json:string>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</json:string></affiliations></json:item><json:item><name>J. Briat</name><affiliations><json:string>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</json:string></affiliations></json:item><json:item><name>J.Chassin de Kergommeaux</name><affiliations><json:string>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</json:string><json:string>E-mail: jacques.chassin-de-kergommeaux@imag.fr</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>Section 3: Languages</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Logic programming</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>OR-parallelism</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Distributed memory</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Side-effects</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>Multi-sequential</value></json:item></subject><language><json:string>eng</json:string></language><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.</abstract><qualityIndicators><score>5.812</score><pdfVersion>1.2</pdfVersion><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>6</keywordCount><abstractCharCount>664</abstractCharCount><pdfWordCount>4564</pdfWordCount><pdfCharCount>28298</pdfCharCount><pdfPageCount>14</pdfPageCount><abstractWordCount>104</abstractWordCount></qualityIndicators><title>Cuts and side-effects in distributed memory OR-parallel prolog</title><pii><json:string>S0167-8191(96)00082-8</json:string></pii><genre><json:string>research-article</json:string></genre><serie><genre></genre><language><json:string>unknown</json:string></language><title>Programming Language Implementation and Logic Programming</title></serie><host><volume>22</volume><pii><json:string>S0167-8191(00)X0024-5</json:string></pii><pages><last>1896</last><first>1883</first></pages><issn><json:string>0167-8191</json:string></issn><issue>13</issue><genre><json:string>Journal</json:string></genre><language><json:string>unknown</json:string></language><title>Parallel Computing</title><publicationDate>1997</publicationDate></host><categories><wos><json:string>COMPUTER SCIENCE, THEORY & METHODS</json:string></wos></categories><publicationDate>1996</publicationDate><copyrightDate>1997</copyrightDate><doi><json:string>10.1016/S0167-8191(96)00082-8</json:string></doi><id>ED6FC05614AD0DC48EC8446A88182E5E01586B96</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/ED6FC05614AD0DC48EC8446A88182E5E01586B96/fulltext/pdf</uri></json:item><json:item><original>true</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/ED6FC05614AD0DC48EC8446A88182E5E01586B96/fulltext/txt</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/ED6FC05614AD0DC48EC8446A88182E5E01586B96/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/ED6FC05614AD0DC48EC8446A88182E5E01586B96/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a">Cuts and side-effects in distributed memory OR-parallel prolog</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>ELSEVIER</publisher><availability><p>ELSEVIER</p></availability><date>1997</date></publicationStmt><notesStmt><note>This work is subject to a cooperation agreement with the KFKI-MSZKI of Budapest, sponsored by the Balaton project No. 95021 of the French ministries of Foreign Affairs and of Education. APACHE is a research project supported by CNRS, INPG, INRIA and UJF.</note><note type="content">Section title: Paper</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">Cuts and side-effects in distributed memory OR-parallel prolog</title><author><persName><forename type="first">É.</forename><surname>Morel</surname></persName><affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</affiliation></author><author><persName><forename type="first">J.</forename><surname>Briat</surname></persName><affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</affiliation></author><author><persName><forename type="first">J.Chassin</forename><surname>de Kergommeaux</surname></persName><email>jacques.chassin-de-kergommeaux@imag.fr</email><note type="correspondence"><p>Corresponding author.</p></note><affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</affiliation></author></analytic><monogr><title level="j">Parallel Computing</title><title level="j" type="abbrev">PARCO</title><idno type="pISSN">0167-8191</idno><idno type="PII">S0167-8191(00)X0024-5</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="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></monogr><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></fileDesc><profileDesc><creation><date>1997</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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.</p></abstract><textClass><keywords scheme="keyword"><list><head>Article category</head><item><term>Section 3: Languages</term></item></list></keywords></textClass><textClass><keywords scheme="keyword"><list><head>Keywords</head><item><term>Logic programming</term></item><item><term>OR-parallelism</term></item><item><term>Distributed memory</term></item><item><term>Side-effects</term></item><item><term>Multi-sequential</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1996-10-21">Received</change><change when="1996-11-14">Modified</change><change when="1996">Published</change></revisionDesc></teiHeader></istex:fulltextTEI></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla"><item-info><jid>PARCO</jid><aid>96000828</aid><ce:pii>S0167-8191(96)00082-8</ce:pii><ce:doi>10.1016/S0167-8191(96)00082-8</ce:doi><ce:copyright type="unknown" year="1997"></ce:copyright><ce:doctopics><ce:doctopic><ce:text>Section 3: Languages</ce:text></ce:doctopic></ce:doctopics></item-info><head><ce:article-footnote><ce:label>☆</ce:label><ce:note-para>This work is subject to a cooperation agreement with the KFKI-MSZKI of Budapest, sponsored by the Balaton project No. 95021 of the French ministries of Foreign Affairs and of Education. APACHE is a research project supported by CNRS, INPG, INRIA and UJF.</ce:note-para></ce:article-footnote><ce:dochead><ce:textfn>Paper</ce:textfn></ce:dochead><ce:title>Cuts and side-effects in distributed memory OR-parallel prolog</ce:title><ce:author-group><ce:author><ce:given-name>É.</ce:given-name><ce:surname>Morel</ce:surname></ce:author><ce:author><ce:given-name>J.</ce:given-name><ce:surname>Briat</ce:surname></ce:author><ce:author><ce:given-name>J.Chassin</ce:given-name><ce:surname>de Kergommeaux</ce:surname><ce:cross-ref refid="COR1"><ce:sup>∗</ce:sup></ce:cross-ref><ce:e-address>jacques.chassin-de-kergommeaux@imag.fr</ce:e-address></ce:author><ce:affiliation><ce:textfn>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</ce:textfn></ce:affiliation><ce:correspondence id="COR1"><ce:label>∗</ce:label><ce:text>Corresponding author.</ce:text></ce:correspondence></ce:author-group><ce:date-received day="21" month="10" year="1996"></ce:date-received><ce:date-revised day="14" month="11" year="1996"></ce:date-revised><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>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.</ce:simple-para></ce:abstract-sec></ce:abstract><ce:keywords><ce:section-title>Keywords</ce:section-title><ce:keyword><ce:text>Logic programming</ce:text></ce:keyword><ce:keyword><ce:text>OR-parallelism</ce:text></ce:keyword><ce:keyword><ce:text>Distributed memory</ce:text></ce:keyword><ce:keyword><ce:text>Side-effects</ce:text></ce:keyword><ce:keyword><ce:text>Multi-sequential</ce:text></ce:keyword></ce:keywords></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>Cuts and side-effects in distributed memory OR-parallel prolog</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Cuts and side-effects in distributed memory OR-parallel prolog</title></titleInfo><name type="personal"><namePart type="given">É.</namePart><namePart type="family">Morel</namePart><affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Briat</namePart><affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.Chassin</namePart><namePart type="family">de Kergommeaux</namePart><affiliation>Projet CNRS-INRIA APACHE, LMC-IMAG, P.O. Box 53, F-38041 Grenoble, Cedex 9, France</affiliation><affiliation>E-mail: jacques.chassin-de-kergommeaux@imag.fr</affiliation><description>Corresponding author.</description><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article"></genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1996</dateIssued><dateCaptured encoding="w3cdtf">1996-10-21</dateCaptured><dateModified encoding="w3cdtf">1996-11-14</dateModified><copyrightDate encoding="w3cdtf">1997</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract 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.</abstract><note>This work is subject to a cooperation agreement with the KFKI-MSZKI of Budapest, sponsored by the Balaton project No. 95021 of the French ministries of Foreign Affairs and of Education. APACHE is a research project supported by CNRS, INPG, INRIA and UJF.</note><note type="content">Section title: Paper</note><subject><genre>Article category</genre><topic>Section 3: Languages</topic></subject><subject><genre>Keywords</genre><topic>Logic programming</topic><topic>OR-parallelism</topic><topic>Distributed memory</topic><topic>Side-effects</topic><topic>Multi-sequential</topic></subject><relatedItem type="host"><titleInfo><title>Parallel Computing</title></titleInfo><titleInfo type="abbreviated"><title>PARCO</title></titleInfo><genre type="Journal">journal</genre><originInfo><dateIssued encoding="w3cdtf">19970228</dateIssued></originInfo><identifier type="ISSN">0167-8191</identifier><identifier type="PII">S0167-8191(00)X0024-5</identifier><part><date>19970228</date><detail type="issue"><title>Distributed and parellel systems: Environments and tools</title></detail><detail type="volume"><number>22</number><caption>vol.</caption></detail><detail type="issue"><number>13</number><caption>no.</caption></detail><extent unit="issue pages"><start>1699</start><end>1930</end></extent><extent unit="pages"><start>1883</start><end>1896</end></extent></part></relatedItem><identifier type="istex">ED6FC05614AD0DC48EC8446A88182E5E01586B96</identifier><identifier type="DOI">10.1016/S0167-8191(96)00082-8</identifier><identifier type="PII">S0167-8191(96)00082-8</identifier><recordInfo><recordContentSource>ELSEVIER</recordContentSource></recordInfo></mods></metadata><enrichments><istex:catWosTEI uri="https://api.istex.fr/document/ED6FC05614AD0DC48EC8446A88182E5E01586B96/enrichments/catWos"><teiHeader><profileDesc><textClass><classCode scheme="WOS">COMPUTER SCIENCE, THEORY & METHODS</classCode></textClass></profileDesc></teiHeader></istex:catWosTEI></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F24 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000F24 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= OperaV1
|flux= Istex
|étape= Corpus
|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. |  |