Petascale Computing for Large-Scale Graph Problems
Identifieur interne : 000E24 ( Main/Merge ); précédent : 000E23; suivant : 000E25Petascale Computing for Large-Scale Graph Problems
Auteurs : A. Bader [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: Graph theoretic problems are representative of fundamental kernels in traditional and emerging computational sciences such as chemistry, biology, and medicine, as well as applications in national security. Yet they pose serious challenges for parallel machines due to non-contiguous, concurrent accesses to global data structures with low degrees of locality. Few parallel graph algorithms outperform their best sequential implementation due to long memory latencies and high synchronization costs. In this talk, we consider several graph theoretic kernels for connectivity and centrality and discuss how the features of petascale architectures will affect algorithm development, ease of programming, performance, and scalability.
Url:
DOI: 10.1007/978-3-540-68111-3_18
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000164
- to stream Istex, to step Curation: 000164
- to stream Istex, to step Checkpoint: 000508
Links to Exploration step
ISTEX:113A5B1B57C6EAC27ADE2EF04FF80E2F557927A0Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Petascale Computing for Large-Scale Graph Problems</title><author><name sortKey="Bader, A" sort="Bader, A" uniqKey="Bader A" first="A." last="Bader">A. Bader</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:113A5B1B57C6EAC27ADE2EF04FF80E2F557927A0</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-68111-3_18</idno><idno type="url">https://api.istex.fr/document/113A5B1B57C6EAC27ADE2EF04FF80E2F557927A0/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000164</idno><idno type="wicri:Area/Istex/Curation">000164</idno><idno type="wicri:Area/Istex/Checkpoint">000508</idno><idno type="wicri:doubleKey">0302-9743:2008:Bader A:petascale:computing:for</idno><idno type="wicri:Area/Main/Merge">000E24</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Petascale Computing for Large-Scale Graph Problems</title><author><name sortKey="Bader, A" sort="Bader, A" uniqKey="Bader A" first="A." last="Bader">A. Bader</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>College of Computing, Georgia Institute of Technology, GA 30332, Atlanta</wicri:regionArea><wicri:noRegion>Atlanta</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2008</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">113A5B1B57C6EAC27ADE2EF04FF80E2F557927A0</idno><idno type="DOI">10.1007/978-3-540-68111-3_18</idno><idno type="ChapterID">18</idno><idno type="ChapterID">Chap18</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Graph theoretic problems are representative of fundamental kernels in traditional and emerging computational sciences such as chemistry, biology, and medicine, as well as applications in national security. Yet they pose serious challenges for parallel machines due to non-contiguous, concurrent accesses to global data structures with low degrees of locality. Few parallel graph algorithms outperform their best sequential implementation due to long memory latencies and high synchronization costs. In this talk, we consider several graph theoretic kernels for connectivity and centrality and discuss how the features of petascale architectures will affect algorithm development, ease of programming, performance, and scalability.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000E24 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 000E24 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:113A5B1B57C6EAC27ADE2EF04FF80E2F557927A0
|texte= Petascale Computing for Large-Scale Graph Problems
}}
| This area was generated with Dilib version V0.6.25. |  |