2020
DOI: 10.1021/acs.jctc.0c00290
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Implementation of Density Functional Theory Methods in the Quantum Interaction Computational Kernel Program

Abstract: We present the details of a GPU capable exchange correlation (XC) scheme integrated into the open source QUantum Interaction Computational Kernel (QUICK) program. Our implementation features an octree based numerical grid point partitioning scheme, GPU enabled grid pruning and basis/primitive function prescreening and fully GPU capable XC energy and gradient algorithms. Benchmarking against the CPU version demonstrated that the GPU implementation is capable of delivering an impres-sive performance while retain… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
56
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 38 publications
(57 citation statements)
references
References 55 publications
(86 reference statements)
1
56
0
Order By: Relevance
“…Given quadrature microbatches with a sufficiently small spatial extent, basis screening via Equation 10produces an approximately constant number of basis functions per quadrature batch, thus leading to an overall scaling that depends only on the number of quadrature points. There are several ways to obtain the quadrature batches (Stratmann et al, 1996;Burow and Sierka, 2011;Manathunga et al, 2020). In this work, we recursively subdivide the domain spanned by the quadrature points into cuboids until the number of quadrature points within each cuboid is below a certain threshold.…”
Section: Numerical Integration Of Molecular Integrandsmentioning
confidence: 99%
See 3 more Smart Citations
“…Given quadrature microbatches with a sufficiently small spatial extent, basis screening via Equation 10produces an approximately constant number of basis functions per quadrature batch, thus leading to an overall scaling that depends only on the number of quadrature points. There are several ways to obtain the quadrature batches (Stratmann et al, 1996;Burow and Sierka, 2011;Manathunga et al, 2020). In this work, we recursively subdivide the domain spanned by the quadrature points into cuboids until the number of quadrature points within each cuboid is below a certain threshold.…”
Section: Numerical Integration Of Molecular Integrandsmentioning
confidence: 99%
“…In this work, we have chosen this threshold to be 512 quadrature points. In practice, this partitioning scheme produces batches similar to the octree method of Manathunga et al (2020). However, rather than bisecting every domain into octants, cuboids that contain an atomic center are partitioned into 27 cuboids as shown in Figure 1.…”
Section: Numerical Integration Of Molecular Integrandsmentioning
confidence: 99%
See 2 more Smart Citations
“…DFT-based QM/MM calculations require utilization of supercomputer facilities and many CPUs. Recently, considerable efforts have been performed to develop a GPU-based DFT code [8,9,11,12,18,19]. It was implemented in the TeraChem program package [17].…”
Section: Introductionmentioning
confidence: 99%