Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Performance Analysis of Irregular Collective Communication with the Crystal Router Algorithm
KTH, School of Computer Science and Communication (CSC), High Performance Computing and Visualization (HPCViz). KTH, Centres, SeRC - Swedish e-Science Research Centre.ORCID iD: 0000-0002-5415-1248
KTH, School of Computer Science and Communication (CSC), High Performance Computing and Visualization (HPCViz). KTH, Centres, SeRC - Swedish e-Science Research Centre.ORCID iD: 0000-0002-9901-9857
2015 (English)In: Solving software challenges for exascale, 2015, 130-140 p.Conference paper, Published paper (Refereed)
Abstract [en]

In order to achieve exascale performance it is important to detect potential bottlenecks and identify strategies to overcome them. For this, both applications and system software must be analysed and potentially improved. The EU FP7 project Collaborative Research into Exascale Systemware, Tools & Applications (CRESTA) chose the approach to co-design advanced simulation applications and system software as well as development tools. In this paper, we present the results of a co-design activity focused on the simulation code NEK5000 that aims at performance improvements of collective communication operations. We have analysed the algorithms that form the core of NEK5000's communication module in order to assess its viability on recent computer architectures before starting to improve its performance. Our results show that the crystal router algorithm performs well in sparse, irregular collective operations for medium and large processor number but improvements for even larger system sizes of the future will be needed. We sketch the needed improvements, which will make the communication algorithms also beneficial for other applications that need to implement latency-dominated communication schemes with short messages. The latency-optimised communication operations will also become used in a runtime-system providing dynamic load balancing, under development within CRESTA.

Place, publisher, year, edition, pages
2015. 130-140 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8759
Keyword [en]
Collective operations, MPI, Performance tuning
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-170717DOI: 10.1007/978-3-319-15976-8_10ISI: 000355749700010Scopus ID: 2-s2.0-84928920465ISBN: 978-3-319-15975-1 (print)ISBN: 978-3-319-15976-8 (print)OAI: oai:DiVA.org:kth-170717DiVA: diva2:839900
Conference
2nd International Conference on Exascale Applications and Software (EASC), APR 02-03, 2014, Stockholm, SWEDEN
Note

QC 20150706

Available from: 2015-07-06 Created: 2015-07-03 Last updated: 2015-07-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Schliephake, MichaelLaure, Erwin

Search in DiVA

By author/editor
Schliephake, MichaelLaure, Erwin
By organisation
High Performance Computing and Visualization (HPCViz)SeRC - Swedish e-Science Research Centre
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 30 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf