Managing distributed shared arrays in a bulk‐synchronous parallel programming environment
Identifieur interne : 001905 ( Main/Exploration ); précédent : 001904; suivant : 001906Managing distributed shared arrays in a bulk‐synchronous parallel programming environment
Auteurs : Christoph W. Kessler [Suède]Source :
- 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
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001230
- to stream Istex, to step Curation: 001118
- to stream Istex, to step Checkpoint: 000975
- to stream Main, to step Merge: 001A96
- to stream Main, to step Curation: 001905
Le 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></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><idno type="wicri:Area/Istex/Curation">001118</idno><idno type="wicri:Area/Istex/Checkpoint">000975</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000975</idno><idno type="wicri:doubleKey">1532-0626:2004:Kessler C:managing:distributed:shared</idno><idno type="wicri:Area/Main/Merge">001A96</idno><idno type="wicri:Area/Main/Curation">001905</idno><idno type="wicri:Area/Main/Exploration">001905</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 wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>Programming Environments Laboratory (PELAB), Department of Computer Science, Linköping University, S‐581 83 Linköping</wicri:regionArea><wicri:noRegion>S‐581 83 Linköping</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>PELAB, Inst. för datavetenskap, Linköpings Universitet, S‐581 83 Linköping</wicri:regionArea><wicri:noRegion>S‐581 83 Linköping</wicri:noRegion></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><affiliations><list><country><li>Suède</li></country></list><tree><country name="Suède"><noRegion><name sortKey="Kessler, Christoph W" sort="Kessler, Christoph W" uniqKey="Kessler C" first="Christoph W." last="Kessler">Christoph W. Kessler</name></noRegion><name sortKey="Kessler, Christoph W" sort="Kessler, Christoph W" uniqKey="Kessler C" first="Christoph W." last="Kessler">Christoph W. Kessler</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001905 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001905 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|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. |  |