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
Towards a Parallel Algebraic Multigrid Solver Using PGAS
KTH, School of Electrical Engineering and Computer Science (EECS), Computational Science and Technology (CST).ORCID iD: 0000-0002-5020-1631
KTH, School of Electrical Engineering and Computer Science (EECS), Computational Science and Technology (CST).ORCID iD: 0000-0002-9901-9857
2018 (English)In: 2018 Workshop on High Performance Computing Asia, New York, NY, USA: Association for Computing Machinery (ACM), 2018, p. 31-38Conference paper, Published paper (Refereed)
Abstract [en]

The Algebraic Multigrid (AMG) method has over the years developed into an efficient tool for solving unstructured linear systems. The need to solve large industrial problems discretized on unstructured meshes, has been a key motivation for devising a parallel AMG method. Despite some success, the key part of the AMG algorithm; the coarsening step, is far from trivial to parallelize efficiently. We here introduce a novel parallelization of the inherently sequential Ruge-Stüben coarsening algorithm, that retains most of the good interpolation properties of the original method. Our parallelization is based on the Partitioned Global Address Space (PGAS) abstraction, which greatly simplifies the parallelization as compared to traditional message passing based implementations. The coarsening algorithm and solver is described in detail and a performance study on a Cray XC40 is presented.

Place, publisher, year, edition, pages
New York, NY, USA: Association for Computing Machinery (ACM), 2018. p. 31-38
Series
ACM International Conference Proceeding Series
National Category
Computational Mathematics
Research subject
Applied and Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-222237DOI: 10.1145/3176364.3176368Scopus ID: 2-s2.0-8504326919ISBN: 978-1-4503-6347-1 (print)OAI: oai:DiVA.org:kth-222237DiVA, id: diva2:1180107
Conference
HPC Asia 2018: International Conference on High Performance Computing in Asia-Pacific Region, Tokyo, Japan, 29-31 January 2018
Funder
Swedish National Infrastructure for Computing (SNIC)
Note

QC 20180207

Available from: 2018-02-05 Created: 2018-02-05 Last updated: 2018-03-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Jansson, NiclasLaure, Erwin
By organisation
Computational Science and Technology (CST)
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 183 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