Efficient large-scale replica-exchange simulations on production infrastructure.
Identifieur interne : 000248 ( Ncbi/Checkpoint ); précédent : 000247; suivant : 000249Efficient large-scale replica-exchange simulations on production infrastructure.
Auteurs : Abhinav Thota [États-Unis] ; André Luckow ; Shantenu JhaSource :
- Philosophical transactions. Series A, Mathematical, physical, and engineering sciences [ 1364-503X ] ; 2011.
English descriptors
- KwdEn :
- MESH :
- metabolism : Hepacivirus.
- methods : Biophysics.
- virology : Hepatitis C.
- Algorithms, Humans, Models, Theoretical, Probability.
Abstract
Replica-exchange (RE) algorithms are used to understand physical phenomena--ranging from protein folding dynamics to binding affinity calculations. They represent a class of algorithms that involve a large number of loosely coupled ensembles, and are thus amenable to using distributed resources. We develop a framework for RE that supports different replica pairing (synchronous versus asynchronous) and exchange coordination mechanisms (centralized versus decentralized) and which can use a range of production cyberinfrastructures concurrently. We characterize the performance of both RE algorithms at an unprecedented number of cores employed--the number of replicas and the typical number of cores per replica--on the production distributed infrastructure. We find that the asynchronous algorithms outperform the synchronous algorithms, even though details of the specific implementations are important determinants of performance.
DOI: 10.1098/rsta.2011.0151
PubMed: 21768142
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PubMed, to step Corpus: 000036
- to stream PubMed, to step Curation: 000036
- to stream PubMed, to step Checkpoint: 000036
- to stream Ncbi, to step Merge: 000248
- to stream Ncbi, to step Curation: 000248
Links to Exploration step
pubmed:21768142Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient large-scale replica-exchange simulations on production infrastructure.</title>
<author><name sortKey="Thota, Abhinav" sort="Thota, Abhinav" uniqKey="Thota A" first="Abhinav" last="Thota">Abhinav Thota</name>
<affiliation wicri:level="2"><nlm:affiliation>Centre for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Centre for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803</wicri:regionArea>
<placeName><region type="state">Louisiane</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Luckow, Andre" sort="Luckow, Andre" uniqKey="Luckow A" first="André" last="Luckow">André Luckow</name>
</author>
<author><name sortKey="Jha, Shantenu" sort="Jha, Shantenu" uniqKey="Jha S" first="Shantenu" last="Jha">Shantenu Jha</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">PubMed</idno>
<date when="2011">2011</date>
<idno type="doi">10.1098/rsta.2011.0151</idno>
<idno type="RBID">pubmed:21768142</idno>
<idno type="pmid">21768142</idno>
<idno type="wicri:Area/PubMed/Corpus">000036</idno>
<idno type="wicri:Area/PubMed/Curation">000036</idno>
<idno type="wicri:Area/PubMed/Checkpoint">000036</idno>
<idno type="wicri:Area/Ncbi/Merge">000248</idno>
<idno type="wicri:Area/Ncbi/Curation">000248</idno>
<idno type="wicri:Area/Ncbi/Checkpoint">000248</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Efficient large-scale replica-exchange simulations on production infrastructure.</title>
<author><name sortKey="Thota, Abhinav" sort="Thota, Abhinav" uniqKey="Thota A" first="Abhinav" last="Thota">Abhinav Thota</name>
<affiliation wicri:level="2"><nlm:affiliation>Centre for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803, USA.</nlm:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Centre for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803</wicri:regionArea>
<placeName><region type="state">Louisiane</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Luckow, Andre" sort="Luckow, Andre" uniqKey="Luckow A" first="André" last="Luckow">André Luckow</name>
</author>
<author><name sortKey="Jha, Shantenu" sort="Jha, Shantenu" uniqKey="Jha S" first="Shantenu" last="Jha">Shantenu Jha</name>
</author>
</analytic>
<series><title level="j">Philosophical transactions. Series A, Mathematical, physical, and engineering sciences</title>
<idno type="ISSN">1364-503X</idno>
<imprint><date when="2011" type="published">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term>
<term>Biophysics (methods)</term>
<term>Hepacivirus (metabolism)</term>
<term>Hepatitis C (virology)</term>
<term>Humans</term>
<term>Models, Theoretical</term>
<term>Probability</term>
</keywords>
<keywords scheme="MESH" qualifier="metabolism" xml:lang="en"><term>Hepacivirus</term>
</keywords>
<keywords scheme="MESH" qualifier="methods" xml:lang="en"><term>Biophysics</term>
</keywords>
<keywords scheme="MESH" qualifier="virology" xml:lang="en"><term>Hepatitis C</term>
</keywords>
<keywords scheme="MESH" xml:lang="en"><term>Algorithms</term>
<term>Humans</term>
<term>Models, Theoretical</term>
<term>Probability</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Replica-exchange (RE) algorithms are used to understand physical phenomena--ranging from protein folding dynamics to binding affinity calculations. They represent a class of algorithms that involve a large number of loosely coupled ensembles, and are thus amenable to using distributed resources. We develop a framework for RE that supports different replica pairing (synchronous versus asynchronous) and exchange coordination mechanisms (centralized versus decentralized) and which can use a range of production cyberinfrastructures concurrently. We characterize the performance of both RE algorithms at an unprecedented number of cores employed--the number of replicas and the typical number of cores per replica--on the production distributed infrastructure. We find that the asynchronous algorithms outperform the synchronous algorithms, even though details of the specific implementations are important determinants of performance.</div>
</front>
</TEI>
<affiliations><list><country><li>États-Unis</li>
</country>
<region><li>Louisiane</li>
</region>
</list>
<tree><noCountry><name sortKey="Jha, Shantenu" sort="Jha, Shantenu" uniqKey="Jha S" first="Shantenu" last="Jha">Shantenu Jha</name>
<name sortKey="Luckow, Andre" sort="Luckow, Andre" uniqKey="Luckow A" first="André" last="Luckow">André Luckow</name>
</noCountry>
<country name="États-Unis"><region name="Louisiane"><name sortKey="Thota, Abhinav" sort="Thota, Abhinav" uniqKey="Thota A" first="Abhinav" last="Thota">Abhinav Thota</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Ncbi/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000248 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Ncbi/Checkpoint/biblio.hfd -nk 000248 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= CyberinfraV1 |flux= Ncbi |étape= Checkpoint |type= RBID |clé= pubmed:21768142 |texte= Efficient large-scale replica-exchange simulations on production infrastructure. }}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/Ncbi/Checkpoint/RBID.i -Sk "pubmed:21768142" \ | HfdSelect -Kh $EXPLOR_AREA/Data/Ncbi/Checkpoint/biblio.hfd \ | NlmPubMed2Wicri -a CyberinfraV1
This area was generated with Dilib version V0.6.25. |