Answers are grounded in this paper and cite their sources.
We present a hybrid OpenMP/Charm++ framework for solving the O (N) self-consistent-field eigenvalue problem with parallelism in the strong scaling regime, PN, where P is the number of cores, and N is a measure of system size, i.e., the number of matrix rows/columns, basis functions, atoms, molecules, etc. This result is achieved with a nested approach to spectral projection and the sparse approximate matrix multiply [Bock and Challacombe, SIAM J. Sci. Comput., 35 (2013), pp. C72--C98], and involves a recursive, task-parallel algorithm, often employed by generalized N-Body solvers, to occlusion and culling of negligible products in the case of matrices with decay. Employing classic technologies associated with generalized N-Body solvers, including overdecomposition, recursive task parallelism, orderings that preserve locality, and persistence-based load balancing, we obtain scaling beyond hundreds of cores per molecule for small water clusters ([H₂O]N, N ∈ \ 30, 90, 150 \, P/N ≈ \ 819, 273, 164 \) and find support for an increasingly strong scalability with increasing system size N.
No takes yet. Share an insight, caveat, or question.
Bock et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: