Very-Large-Scale GPU-Accelerated Nuclear Gradient of Time-Dependent Density Functional Theory with Tamm–Dancoff Approximation and Range-Separated Hybrid Functionals

Modern graphics processing units (GPUs) provide an unprecedented level of computing power. In this study, we present a high-performance, multi-GPU implementation of the analytical nuclear gradient for Kohn-Sham time-dependent density functional theory (TDDFT), employing the Tamm-Dancoff approximation (TDA) and Gaussian-type atomic orbitals as basis functions. We discuss GPU-efficient algorithms for the derivatives of electron repulsion integrals and exchange-correlation functionals within the range-separated scheme. As an illustrative example, we calculate the TDA-TDDFT gradient of the S<sub>1</sub> state of a full-scale green fluorescent protein with explicit water solvent molecules, totaling 4353 atoms, at the ωB97X/def2-SVP level of theory. Our algorithm demonstrates favorable parallel efficiencies on a high-speed distributed system equipped with 256 Nvidia A100 GPUs, achieving >70% with up to 64 GPUs and 31% with 256 GPUs, effectively leveraging the capabilities of modern high-performance computing systems.

Authors

Institutions

Publication Details

Journal
Journal of Chemical Theory and Computation
Published
2024-10-07
DOI
https://doi.org/10.1021/acs.jctc.4c01003
Citations
7
Primary Topic
Advanced NMR Techniques and Applications
Type
article
Field-Weighted Citation Impact
1.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Very-Large-Scale GPU-Accelerated Nuclear Gradient of Time-Dependent Density Functional Theory with Tamm–Dancoff Approximation and Range-Separated Hybrid Functionals

Young Min Rhee, Dae Sin Kim, Inkook Jang, Troy Van Voorhis et al.
7 citations
Journal of Chemical Theory and Computation
Advanced NMR Techniques and Applications
1.69
article

Very-Large-Scale GPU-Accelerated Nuclear Gradient of Time-Dependent Density Functional Theory with Tamm–Dancoff Approximation and Range-Separated Hybrid Functionals

Young Min Rhee, Dae Sin Kim, Inkook Jang, Troy Van Voorhis, Jinkyu Yim, Won‐Joon Son, Inkoo Kim, Yeonchoo Cho, Alexandra Alexiu, Seungmin Lee, Sungmin Kim, Hyung‐Jin Kim, Daun Jeong, Leah P. Weisburn
article en
7 citations

Abstract

Modern graphics processing units (GPUs) provide an unprecedented level of computing power. In this study, we present a high-performance, multi-GPU implementation of the analytical nuclear gradient for Kohn-Sham time-dependent density functional theory (TDDFT), employing the Tamm-Dancoff approximation (TDA) and Gaussian-type atomic orbitals as basis functions. We discuss GPU-efficient algorithms for the derivatives of electron repulsion integrals and exchange-correlation functionals within the range-separated scheme. As an illustrative example, we calculate the TDA-TDDFT gradient of the S<sub>1</sub> state of a full-scale green fluorescent protein with explicit water solvent molecules, totaling 4353 atoms, at the ωB97X/def2-SVP level of theory. Our algorithm demonstrates favorable parallel efficiencies on a high-speed distributed system equipped with 256 Nvidia A100 GPUs, achieving >70% with up to 64 GPUs and 31% with 256 GPUs, effectively leveraging the capabilities of modern high-performance computing systems.

Journal of Chemical Theory and ComputationVol. 20(20)
Korea Advanced Institute of Science and Technology (KR), Samsung (South Korea) (KR), Massachusetts Institute of Technology (US)
Samsung
Affordable and clean energy
Openalex Percentile: Top 17%
Advanced NMR Techniques and Applications
1.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.