SC20: International Conference for High Performance Computing, Networking, Storage and Analysis 2020
DOI: 10.1109/sc41405.2020.00008
|View full text |Cite
|
Sign up to set email alerts
|

Accelerating Large-Scale Excited-State GW Calculations on Leadership HPC Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
28
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 28 publications
(29 citation statements)
references
References 34 publications
0
28
0
1
Order By: Relevance
“…This operation appears very often as a building block of linear algebra calculations like computation of the wavefunction overlap matrix, S = ψ † ψ, in quantum mechanics. [26,27] In those applications, ψ may consist of hundreds of thousands of tiles like A and B, giving rise to millions of tasks. In these workflows, however, neglect the hypothetical communication steps needed to sum the results in computing S. Each task management system was benchmarked using a weak-scaling methodology -where number of tasks scaled with processors.…”
Section: Evaluation Methodsmentioning
confidence: 99%
“…This operation appears very often as a building block of linear algebra calculations like computation of the wavefunction overlap matrix, S = ψ † ψ, in quantum mechanics. [26,27] In those applications, ψ may consist of hundreds of thousands of tiles like A and B, giving rise to millions of tasks. In these workflows, however, neglect the hypothetical communication steps needed to sum the results in computing S. Each task management system was benchmarked using a weak-scaling methodology -where number of tasks scaled with processors.…”
Section: Evaluation Methodsmentioning
confidence: 99%
“…This work involves three major computation steps: 1) DFPT calculation using the ABINIT code [29]; 2) GWPT calculation using the BerkeleyGW code [19,20,30,31]; and 3) Wannier interpolation using the EPW code [32,59]. We have developed wrappers to link the three codes.…”
Section: Computational Detailsmentioning
confidence: 99%
“…For these reasons, MBPT calculations typically require computing architectures with a much larger number of nodes and larger memory. Efficient numerical schemes implemented in several codes [114][115][116] have partly alleviated these problems, enabling a significant speed-up on highly parallelized hardware. All in all, at present, MBPT calculations (GW and BSE) on systems with about 50 atoms are performed on the timescale of the order of a few tens of hours.…”
Section: Computational Costsmentioning
confidence: 99%