Managing distributed shared arrays in a bulk‐synchronous parallel programming environment
Identifieur interne : 001230 ( Istex/Corpus ); précédent : 001229; suivant : 001231Managing distributed shared arrays in a bulk‐synchronous parallel programming environment
Auteurs : Christoph W. KesslerSource :
- Concurrency and Computation: Practice and Experience [ 1532-0626 ] ; 2004-02.
English descriptors
- KwdEn :
Abstract
NestStep is a parallel programming language for the BSP (bulk‐hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two‐sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one‐sided communication. The main prerequisite is that the given program is structured in a BSP‐compliant way. Copyright © 2004 John Wiley & Sons, Ltd.
Url:
DOI: 10.1002/cpe.768
Links to Exploration step
ISTEX:1833ECF76E2A1A410E3B79899221DE19D7A4F899Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title><author><name sortKey="Kessler, Christoph W" sort="Kessler, Christoph W" uniqKey="Kessler C" first="Christoph W." last="Kessler">Christoph W. Kessler</name><affiliation><mods:affiliation>Programming Environments Laboratory (PELAB), Department of Computer Science, Linköping University, S‐581 83 Linköping, Sweden</mods:affiliation></affiliation><affiliation><mods:affiliation>PELAB, Inst. för datavetenskap, Linköpings Universitet, S‐581 83 Linköping, Sweden</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1833ECF76E2A1A410E3B79899221DE19D7A4F899</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1002/cpe.768</idno><idno type="url">https://api.istex.fr/document/1833ECF76E2A1A410E3B79899221DE19D7A4F899/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001230</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001230</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title><author><name sortKey="Kessler, Christoph W" sort="Kessler, Christoph W" uniqKey="Kessler C" first="Christoph W." last="Kessler">Christoph W. Kessler</name><affiliation><mods:affiliation>Programming Environments Laboratory (PELAB), Department of Computer Science, Linköping University, S‐581 83 Linköping, Sweden</mods:affiliation></affiliation><affiliation><mods:affiliation>PELAB, Inst. för datavetenskap, Linköpings Universitet, S‐581 83 Linköping, Sweden</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Concurrency and Computation: Practice and Experience</title><title level="j" type="abbrev">Concurrency Computat.: Pract. Exper.</title><idno type="ISSN">1532-0626</idno><idno type="eISSN">1532-0634</idno><imprint><publisher>John Wiley & Sons, Ltd.</publisher><pubPlace>Chichester, UK</pubPlace><date type="published" when="2004-02">2004-02</date><biblScope unit="volume">16</biblScope><biblScope unit="issue">2‐3</biblScope><biblScope unit="page" from="133">133</biblScope><biblScope unit="page" to="153">153</biblScope></imprint><idno type="ISSN">1532-0626</idno></series><idno type="istex">1833ECF76E2A1A410E3B79899221DE19D7A4F899</idno><idno type="DOI">10.1002/cpe.768</idno><idno type="ArticleID">CPE768</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1532-0626</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>BSP model</term><term>NestStep</term><term>bulk‐synchronous parallelism</term><term>distributed shared array</term><term>parallel programming language</term><term>runtime scheduling of communication</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">NestStep is a parallel programming language for the BSP (bulk‐hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two‐sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one‐sided communication. The main prerequisite is that the given program is structured in a BSP‐compliant way. Copyright © 2004 John Wiley & Sons, Ltd.</div></front></TEI><istex><corpusName>wiley</corpusName><author><json:item><name>Christoph W. Kessler</name><affiliations><json:string>Programming Environments Laboratory (PELAB), Department of Computer Science, Linköping University, S‐581 83 Linköping, Sweden</json:string><json:string>PELAB, Inst. för datavetenskap, Linköpings Universitet, S‐581 83 Linköping, Sweden</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>NestStep</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>BSP model</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>bulk‐synchronous parallelism</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>parallel programming language</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>distributed shared array</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>runtime scheduling of communication</value></json:item></subject><articleId><json:string>CPE768</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>article</json:string></originalGenre><abstract>NestStep is a parallel programming language for the BSP (bulk‐hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two‐sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one‐sided communication. The main prerequisite is that the given program is structured in a BSP‐compliant way. Copyright © 2004 John Wiley & Sons, Ltd.</abstract><qualityIndicators><score>6.26</score><pdfVersion>1.3</pdfVersion><pdfPageSize>595 x 842 pts (A4)</pdfPageSize><refBibsNative>true</refBibsNative><abstractCharCount>695</abstractCharCount><pdfWordCount>8688</pdfWordCount><pdfCharCount>51192</pdfCharCount><pdfPageCount>21</pdfPageCount><abstractWordCount>105</abstractWordCount></qualityIndicators><title>Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title><refBibs><json:item><author><json:item><name>CW Keßler</name></json:item></author><host><volume>17</volume><pages><last>262</last><first>245</first></pages><author></author><title>Journal of Supercomputing</title></host><title>NestStep: Nested parallelism and virtual shared memory for the BSP model</title></json:item><json:item><author><json:item><name>LG Valiant</name></json:item></author><host><volume>33</volume><pages><last>111</last><first>103</first></pages><issue>8</issue><author></author><title>Communications of the ACM</title></host><title>A bridging model for parallel computation</title></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>Keller J, Keßler CW, Träff JL. Practical PRAM Programming. Wiley Interscience, 2001.</title></host></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>Parallel programming in Split‐C</title></host></json:item><json:item><author><json:item><name>AV Gerbessiotis</name></json:item><json:item><name>LG Valiant</name></json:item></author><host><volume>22</volume><pages><last>267</last><first>251</first></pages><author></author><title>Journal of Parallel and Distributed Computing</title></host><title>Direct bulk‐synchronous parallel algorithms</title></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>Parallelism and compilers</title></host></json:item><json:item><author><json:item><name>R Mirchandaney</name></json:item><json:item><name>J Saltz</name></json:item><json:item><name>RM Smith</name></json:item><json:item><name>DM Nicol</name></json:item><json:item><name>K Crowley</name></json:item></author><host><pages><last>152</last><first>140</first></pages><author></author><title>Proceedings of the 2nd ACM International Conference on Supercomputing</title></host><title>Principles of run‐time support for parallel processors</title></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>ANL Argonne National Laboratories. MPICH—a portable implementation of MPI, version 1.2. http://www‐unix.mcs.anl.gov/mpi/mpich/ [1999].</title></host></json:item><json:item><author><json:item><name>JMD Hill</name></json:item><json:item><name>B McColl</name></json:item><json:item><name>DC Stefanescu</name></json:item><json:item><name>MW Goudreau</name></json:item><json:item><name>K Lang</name></json:item><json:item><name>SB Rao</name></json:item><json:item><name>T Suel</name></json:item><json:item><name>T Tsantilas</name></json:item><json:item><name>R Bisseling</name></json:item></author><host><volume>24</volume><pages><last>1980</last><first>1947</first></pages><issue>14</issue><author></author><title>Parallel Computing</title></host><title>BSPlib: The BSP programming library</title></json:item><json:item><author><json:item><name>O Bonorden</name></json:item><json:item><name>B Juurlink</name></json:item><json:item><name>I von Otte</name></json:item><json:item><name>I Rieping</name></json:item></author><host><author></author><title>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP'99)</title></host><title>The Paderborn University BSP (PUB) Library: Design, implementation and performance</title></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>Snyder L. A programmers guide to ZPL, Version 6.3. http://www.cs.washington.edu/research/zpl [1999].</title></host></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>C*: An extended C language for data parallel programming</title></host></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>Hatcher PJ, Quinn MJ. Data‐Parallel Programming on MIMD Computers. MIT Press: Cambridge, MA, 1991.</title></host></json:item><json:item><author></author><host><volume>2</volume><author></author><title>Scientific Programming</title></host><title>High performance Fortran language specification</title></json:item><json:item><author><json:item><name>R Schreiber</name></json:item></author><host><volume>7</volume><pages><last>449</last><first>437</first></pages><issue>4</issue><author></author><title>Parallel Processing Letters</title></host><title>High performance Fortran, version 2</title></json:item><json:item><host><volume>12</volume><issue>15</issue><author></author><title>OpenMP Architecture Review Board. OpenMP: A proposed industry standard API for shared memory programming. White Paper. http://www.openmp.org/ [October 1997].</title></host></json:item><json:item><author><json:item><name>W Carlson</name></json:item><json:item><name>J Draper</name></json:item></author><host><volume>30</volume><pages><last>47</last><first>39</first></pages><issue>8</issue><author></author><title>Proceedings of the PPoPP'95 Symposium on Principles and Practice of Parallel Programming. ACM SIGPLAN Notices</title></host><title>Distributed data access in AC</title></json:item></refBibs><genre><json:string>article</json:string></genre><host><volume>16</volume><publisherId><json:string>CPE</json:string></publisherId><pages><total>21</total><last>153</last><first>133</first></pages><issn><json:string>1532-0626</json:string></issn><issue>2‐3</issue><author><json:item><name>Michael O'Boyle</name></json:item></author><subject><json:item><value>Research Article</value></json:item></subject><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1532-0634</json:string></eissn><title>Concurrency and Computation: Practice and Experience</title><doi><json:string>10.1002/(ISSN)1532-0634</json:string></doi></host><publicationDate>2004</publicationDate><copyrightDate>2004</copyrightDate><doi><json:string>10.1002/cpe.768</json:string></doi><id>1833ECF76E2A1A410E3B79899221DE19D7A4F899</id><score>0.019739822</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/1833ECF76E2A1A410E3B79899221DE19D7A4F899/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/1833ECF76E2A1A410E3B79899221DE19D7A4F899/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/1833ECF76E2A1A410E3B79899221DE19D7A4F899/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>John Wiley & Sons, Ltd.</publisher><pubPlace>Chichester, UK</pubPlace><availability><p>Copyright © 2004 John Wiley & Sons, Ltd.</p></availability><date>2004</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title><author xml:id="author-1"><persName><forename type="first">Christoph W.</forename><surname>Kessler</surname></persName><affiliation>Programming Environments Laboratory (PELAB), Department of Computer Science, Linköping University, S‐581 83 Linköping, Sweden</affiliation><affiliation>PELAB, Inst. för datavetenskap, Linköpings Universitet, S‐581 83 Linköping, Sweden</affiliation></author></analytic><monogr><title level="j">Concurrency and Computation: Practice and Experience</title><title level="j" type="abbrev">Concurrency Computat.: Pract. Exper.</title><idno type="pISSN">1532-0626</idno><idno type="eISSN">1532-0634</idno><idno type="DOI">10.1002/(ISSN)1532-0634</idno><imprint><publisher>John Wiley & Sons, Ltd.</publisher><pubPlace>Chichester, UK</pubPlace><date type="published" when="2004-02"></date><biblScope unit="volume">16</biblScope><biblScope unit="issue">2‐3</biblScope><biblScope unit="page" from="133">133</biblScope><biblScope unit="page" to="153">153</biblScope></imprint></monogr><idno type="istex">1833ECF76E2A1A410E3B79899221DE19D7A4F899</idno><idno type="DOI">10.1002/cpe.768</idno><idno type="ArticleID">CPE768</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2004</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>NestStep is a parallel programming language for the BSP (bulk‐hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two‐sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one‐sided communication. The main prerequisite is that the given program is structured in a BSP‐compliant way. Copyright © 2004 John Wiley & Sons, Ltd.</p></abstract><textClass xml:lang="en"><keywords scheme="keyword"><list><head>keywords</head><item><term>NestStep</term></item><item><term>BSP model</term></item><item><term>bulk‐synchronous parallelism</term></item><item><term>parallel programming language</term></item><item><term>distributed shared array</term></item><item><term>runtime scheduling of communication</term></item></list></keywords></textClass><textClass><keywords scheme="Journal Subject"><list><head>article-category</head><item><term>Research Article</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2001-09-20">Received</change><change when="2002-07-01">Registration</change><change when="2004-02">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/1833ECF76E2A1A410E3B79899221DE19D7A4F899/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Wiley, elements deleted: body"><istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration><istex:document><component version="2.0" type="serialArticle" xml:lang="en"><header><publicationMeta level="product"><publisherInfo><publisherName>John Wiley & Sons, Ltd.</publisherName><publisherLoc>Chichester, UK</publisherLoc></publisherInfo><doi registered="yes">10.1002/(ISSN)1532-0634</doi><issn type="print">1532-0626</issn><issn type="electronic">1532-0634</issn><idGroup><id type="product" value="CPE"></id></idGroup><titleGroup><title type="main" xml:lang="en" sort="CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE">Concurrency and Computation: Practice and Experience</title><title type="short">Concurrency Computat.: Pract. Exper.</title></titleGroup><selfCitationGroup><citation type="ancestor" xml:id="cit1"><journalTitle>Concurrency: Practice and Experience</journalTitle><accessionId ref="info:x-wiley/issn/10403108">1040-3108</accessionId><accessionId ref="info:x-wiley/issn/10969128">1096-9128</accessionId><pubYear year="2000">2000</pubYear><vol>12</vol><issue>15</issue></citation></selfCitationGroup></publicationMeta><publicationMeta level="part" position="20"><doi origin="wiley" registered="yes">10.1002/cpe.v16:2/3</doi><titleGroup><title type="specialIssueTitle">Compilers for Parallel Computers</title></titleGroup><numberingGroup><numbering type="journalVolume" number="16">16</numbering><numbering type="includedIssue">2</numbering><numbering type="includedIssue">3</numbering><numbering type="journalIssue">2‐3</numbering></numberingGroup><creators><creator xml:id="sped1" creatorRole="sponsoringEditor"><personName><givenNames>Michael</givenNames><familyName>O'Boyle</familyName></personName></creator></creators><coverDate startDate="2004-02">February ‐ March 2004</coverDate></publicationMeta><publicationMeta level="unit" type="article" position="3" status="forIssue"><doi origin="wiley" registered="yes">10.1002/cpe.768</doi><idGroup><id type="unit" value="CPE768"></id></idGroup><countGroup><count type="pageTotal" number="21"></count></countGroup><titleGroup><title type="articleCategory">Research Article</title><title type="tocHeading1">Research Articles</title></titleGroup><copyright ownership="publisher">Copyright © 2004 John Wiley & Sons, Ltd.</copyright><eventGroup><event type="manuscriptReceived" date="2001-09-20"></event><event type="manuscriptRevised" date="2002-05-29"></event><event type="manuscriptAccepted" date="2002-07-01"></event><event type="firstOnline" date="2004-01-07"></event><event type="publishedOnlineFinalForm" date="2004-01-07"></event><event type="xmlConverted" agent="Converter:JWSART34_TO_WML3G version:2.3.3 mode:FullText source:HeaderRef result:HeaderRef" date="2010-03-19"></event><event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:3.8.8" date="2014-01-16"></event><event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.1.7 mode:FullText,remove_FC" date="2014-10-16"></event></eventGroup><numberingGroup><numbering type="pageFirst">133</numbering><numbering type="pageLast">153</numbering></numberingGroup><correspondenceTo>PELAB, Inst. för datavetenskap, Linköpings Universitet, S‐581 83 Linköping, Sweden</correspondenceTo><linkGroup><link type="toTypesetVersion" href="file:CPE.CPE768.pdf"></link></linkGroup></publicationMeta><contentMeta><countGroup><count type="figureTotal" number="4"></count><count type="tableTotal" number="0"></count><count type="referenceTotal" number="17"></count></countGroup><titleGroup><title type="main" xml:lang="en">Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title><title type="short" xml:lang="en">MANAGING DISTRIBUTED SHARED ARRAYS</title></titleGroup><creators><creator xml:id="au1" creatorRole="author" affiliationRef="#af1" corresponding="yes"><personName><givenNames>Christoph W.</givenNames><familyName>Kessler</familyName></personName><contactDetails><email>chrke@ida.liu.se</email></contactDetails></creator></creators><affiliationGroup><affiliation xml:id="af1" countryCode="SE" type="organization"><unparsedAffiliation>Programming Environments Laboratory (PELAB), Department of Computer Science, Linköping University, S‐581 83 Linköping, Sweden</unparsedAffiliation></affiliation></affiliationGroup><keywordGroup xml:lang="en" type="author"><keyword xml:id="kwd1">NestStep</keyword><keyword xml:id="kwd2">BSP model</keyword><keyword xml:id="kwd3">bulk‐synchronous parallelism</keyword><keyword xml:id="kwd4">parallel programming language</keyword><keyword xml:id="kwd5">distributed shared array</keyword><keyword xml:id="kwd6">runtime scheduling of communication</keyword></keywordGroup><abstractGroup><abstract type="main" xml:lang="en"><title type="main">Abstract</title><p>NestStep is a parallel programming language for the BSP (bulk‐hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two‐sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one‐sided communication. The main prerequisite is that the given program is structured in a BSP‐compliant way. Copyright © 2004 John Wiley & Sons, Ltd.</p></abstract></abstractGroup></contentMeta></header></component></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title></titleInfo><titleInfo type="abbreviated" lang="en"><title>MANAGING DISTRIBUTED SHARED ARRAYS</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Managing distributed shared arrays in a bulk‐synchronous parallel programming environment</title></titleInfo><name type="personal"><namePart type="given">Christoph W.</namePart><namePart type="family">Kessler</namePart><affiliation>Programming Environments Laboratory (PELAB), Department of Computer Science, Linköping University, S‐581 83 Linköping, Sweden</affiliation><affiliation>PELAB, Inst. för datavetenskap, Linköpings Universitet, S‐581 83 Linköping, Sweden</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="article" displayLabel="article"></genre><originInfo><publisher>John Wiley & Sons, Ltd.</publisher><place><placeTerm type="text">Chichester, UK</placeTerm></place><dateIssued encoding="w3cdtf">2004-02</dateIssued><dateCaptured encoding="w3cdtf">2001-09-20</dateCaptured><dateValid encoding="w3cdtf">2002-07-01</dateValid><copyrightDate encoding="w3cdtf">2004</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType><extent unit="figures">4</extent><extent unit="references">17</extent></physicalDescription><abstract lang="en">NestStep is a parallel programming language for the BSP (bulk‐hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two‐sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one‐sided communication. The main prerequisite is that the given program is structured in a BSP‐compliant way. Copyright © 2004 John Wiley & Sons, Ltd.</abstract><subject lang="en"><genre>keywords</genre><topic>NestStep</topic><topic>BSP model</topic><topic>bulk‐synchronous parallelism</topic><topic>parallel programming language</topic><topic>distributed shared array</topic><topic>runtime scheduling of communication</topic></subject><relatedItem type="host"><titleInfo><title>Concurrency and Computation: Practice and Experience</title></titleInfo><titleInfo type="abbreviated"><title>Concurrency Computat.: Pract. Exper.</title></titleInfo><name type="personal"><namePart type="given">Michael</namePart><namePart type="family">O'Boyle</namePart></name><genre type="journal">journal</genre><subject><genre>article-category</genre><topic>Research Article</topic></subject><identifier type="ISSN">1532-0626</identifier><identifier type="eISSN">1532-0634</identifier><identifier type="DOI">10.1002/(ISSN)1532-0634</identifier><identifier type="PublisherID">CPE</identifier><part><date>2004</date><detail type="title"><title>Compilers for Parallel Computers</title></detail><detail type="volume"><caption>vol.</caption><number>16</number></detail><detail type="issue"><caption>no.</caption><number>2‐3</number></detail><extent unit="pages"><start>133</start><end>153</end><total>21</total></extent></part></relatedItem><relatedItem type="preceding"><titleInfo><title>Concurrency: Practice and Experience</title></titleInfo><identifier type="ISSN">1040-3108</identifier><identifier type="ISSN">1096-9128</identifier><part><date point="end">2000</date><detail type="volume"><caption>last vol.</caption><number>12</number></detail><detail type="issue"><caption>last no.</caption><number>15</number></detail></part></relatedItem><identifier type="istex">1833ECF76E2A1A410E3B79899221DE19D7A4F899</identifier><identifier type="DOI">10.1002/cpe.768</identifier><identifier type="ArticleID">CPE768</identifier><accessCondition type="use and reproduction" contentType="copyright">Copyright © 2004 John Wiley & Sons, Ltd.</accessCondition><recordInfo><recordContentSource>WILEY</recordContentSource><recordOrigin>John Wiley & Sons, Ltd.</recordOrigin></recordInfo></mods></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001230 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001230 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:1833ECF76E2A1A410E3B79899221DE19D7A4F899
|texte= Managing distributed shared arrays in a bulk‐synchronous parallel programming environment
}}
| This area was generated with Dilib version V0.6.31. |  |