Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning

doi:10.1137/16M109404X

Title: Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning

Full Record
Other Related Research

Abstract

Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms. These constraints arise due to expensive self-consistent ground-state electronic structure calculations that can often scale cubically with the number of atoms. Linearly scaling methods depend on computing the density matrix P from the Hamiltonian matrix H by exploiting the sparsity in both matrices. The second-order spectral projection (SP2) algorithm is an O(N) algorithm that computes P with a sequence of 40 - 50 matrix-matrix multiplications. In this paper, we present task-based implementations of a recently developed data-parallel graph-based approach to the SP2 algorithm, G-SP2. We represent the density matrix P as an undirected graph and use graph partitioning techniques to divide the computation into smaller independent tasks. The partitions thus obtained are generally not of equal size and give rise to undesirable load imbalances in standard MPI-based implementations. This load-balancing challenge can be mitigated by dynamically scheduling parallel computations at runtime using task-based programming models. We develop task-based implementations of the data-parallel G-SP2 algorithm using both Intel's Concurrent Collections (CnC) as well as the Charm++more »« less

Authors:

Ghale, Purnima ^[1]; Kroonblawd, Matthew P. ^[2]; Mniszewski, Sue ^[3]; Negre, Christian F. A. ^[3]; Pavel, Robert ^[3]; Pino, Sergio ^[4]; Sardeshmukh, Vivek ^[5]; Shi, Guangjie ^[6]; Hahn, Georg ^[7]

Univ. of Illinois, Urbana-Champaign, IL (United States)
Univ. of Missouri, Columbia, MO (United States)
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Univ. of Delaware, Newark, DE (United States)
Univ. of Iowa, Iowa City, IA (United States)
Univ. of Georgia, Athens, GA (United States)
Columbia Univ., New York, NY (United States)

Publication Date:: 2017-12-14

Research Org.:: Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

Sponsoring Org.:: USDOE Office of Science (SC). Advanced Scientific Computing Research (ASCR) (SC-21)

OSTI Identifier:: 1501801

Report Number(s):: LA-UR-16-24908
Journal ID: ISSN 1064-8275

Grant/Contract Number:: 89233218CNA000001

Resource Type:: Accepted Manuscript

Journal Name:: SIAM Journal on Scientific Computing

Additional Journal Information:: Journal Volume: 39; Journal Issue: 6; Journal ID: ISSN 1064-8275

Publisher:: SIAM

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING; Computer Science; Mathematics

Citation Formats


                    Ghale, Purnima, Kroonblawd, Matthew P., Mniszewski, Sue, Negre, Christian F.  A., Pavel, Robert, Pino, Sergio, Sardeshmukh, Vivek, Shi, Guangjie, and Hahn, Georg. Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning.  United States: N. p., 2017. 
        Web.  doi:10.1137/16M109404X.

Copy to clipboard


                    Ghale, Purnima, Kroonblawd, Matthew P., Mniszewski, Sue, Negre, Christian F.  A., Pavel, Robert, Pino, Sergio, Sardeshmukh, Vivek, Shi, Guangjie, & Hahn, Georg. Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning.  United States.  doi:10.1137/16M109404X.

Copy to clipboard


                    Ghale, Purnima, Kroonblawd, Matthew P., Mniszewski, Sue, Negre, Christian F.  A., Pavel, Robert, Pino, Sergio, Sardeshmukh, Vivek, Shi, Guangjie, and Hahn, Georg. Thu .  
        "Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning".  United States.  doi:10.1137/16M109404X.  https://www.osti.gov/servlets/purl/1501801.

Copy to clipboard


                    
@article{osti_1501801,

  title        = {Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning},

  author       = {Ghale, Purnima and Kroonblawd, Matthew P. and Mniszewski, Sue and Negre, Christian F.  A. and Pavel, Robert and Pino, Sergio and Sardeshmukh, Vivek and Shi, Guangjie and Hahn, Georg},

  abstractNote = {Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms. These constraints arise due to expensive self-consistent ground-state electronic structure calculations that can often scale cubically with the number of atoms. Linearly scaling methods depend on computing the density matrix P from the Hamiltonian matrix H by exploiting the sparsity in both matrices. The second-order spectral projection (SP2) algorithm is an O(N) algorithm that computes P with a sequence of 40 - 50 matrix-matrix multiplications. In this paper, we present task-based implementations of a recently developed data-parallel graph-based approach to the SP2 algorithm, G-SP2. We represent the density matrix P as an undirected graph and use graph partitioning techniques to divide the computation into smaller independent tasks. The partitions thus obtained are generally not of equal size and give rise to undesirable load imbalances in standard MPI-based implementations. This load-balancing challenge can be mitigated by dynamically scheduling parallel computations at runtime using task-based programming models. We develop task-based implementations of the data-parallel G-SP2 algorithm using both Intel's Concurrent Collections (CnC) as well as the Charm++ programming model and evaluate these implementations for future use. Scaling and performance results of our implementations are investigated for representative segments of QMD simulations for solvated protein systems containing more than 10,000 atoms.},

  doi          = {10.1137/16M109404X},

  journal      = {SIAM Journal on Scientific Computing},

  number       = 6,

  volume       = 39,

  place        = {United States},

  year         = {2017},

  month        = {12}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

DOI: 10.1137/16M109404X

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

Journal Article Djidjev, Hristo N. ; Hahn, Georg ; Mniszewski, Susan M. ; ... - Algorithms

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algorithms relying on evaluations of matrix polynomials have been published in the literature for such simulations. We aim to use a special type of graph partitioning to efficiently parallelize these computations. For this, we create a graph representing the zero–nonzero structure of a thresholded density matrix, and partition that graph into several components. Each separate submatrix (corresponding to each subgraph) is then substituted into themore »« less
DOI: 10.3390/a12090187
Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions

Journal Article Sornborger, Andrew Tyler ; Stancil, Phillip ; Geller, Michael R. - Quantum Information Processing

Here, one of the most promising applications of an error-corrected universal quantum computer is the efficient simulation of complex quantum systems such as large molecular systems. In this application, one is interested in both the electronic structure such as the ground state energy and dynamical properties such as the scattering cross section and chemical reaction rates. However, most theoretical work and experimental demonstrations have focused on the quantum computation of energies and energy surfaces. In this work, we attempt to make the prethreshold (not error-corrected) quantum simulation of dynamical properties practical as well. We show that the use of precomputedmore »« less
DOI: 10.1007/s11128-018-1878-x

Full Text Available
Quantum-classical computation of Schwinger model dynamics using quantum computers

Journal Article Klco, N. ; Dumitrescu, E. F. ; McCaskey, A. J. ; ... - Physical Review A

We present a quantum-classical algorithm to study the dynamics of the two-spatial-site Schwinger model on IBM's quantum computers. Using rotational symmetries, total charge, and parity, the number of qubits needed to perform computation is reduced by a factor of ~5, removing exponentially large unphysical sectors from the Hilbert space. Our work opens an avenue for exploration of other lattice quantum field theories, such as quantum chromodynamics, where classical computation is used to find symmetry sectors in which the quantum computer evaluates the dynamics of quantum fluctuations.
Cited by 15
DOI: 10.1103/PhysRevA.98.032331

Full Text Available
Computation of Hydration Free Energies Using the Multiple Environment Single System Quantum Mechanical/Molecular Mechanical Method

Journal Article König, Gerhard ; Mei, Ye ; Pickard, IV, Frank C. ; ... - Journal of Chemical Theory and Computation

A recently-developed MESS-E-QM/MM method (multiple-environment single-system quantum mechanical molecular/mechanical calculations with a Roothaan-step extrapolation) is applied to the computation of hydration free energies for the blind SAMPL4 test set and for twelve small molecules. First, free energy simulations are performed with classical molecular mechanics force field using fixed-geometry solute molecules and explicit TIP3P solvent, then the non-Boltzmann-Bennett method is employed to compute the QM/MM correction (QM/MM-NBB) to the molecular mechanical hydration free energies. For the SAMPL4 set, MESS-E-QM/MM-NBB corrections to the hydration free energy can be obtained 2 or 3 orders of magnitude faster than fully converged QM/MM-NBB corrections, and,more »« less
Cited by 20
DOI: 10.1021/acs.jctc.5b00874

Full Text Available
Recursive Factorization of the Inverse Overlap Matrix in Linear Scaling Quantum Molecular Dynamics Simulations

Journal Article Negre, Christian F. A ; Mniszewski, Susan M. ; Cawkwell, Marc Jon ; ... - Journal of Chemical Theory and Computation

We present a reduced complexity algorithm to compute the inverse overlap factors required to solve the generalized eigenvalue problem in a quantum-based molecular dynamics (MD) simulation. Our method is based on the recursive iterative re nement of an initial guess Z of the inverse overlap matrix S. The initial guess of Z is obtained beforehand either by using an approximate divide and conquer technique or dynamically, propagated within an extended Lagrangian dynamics from previous MD time steps. With this formulation, we achieve long-term stability and energy conservation even under incomplete approximate iterative re nement of Z. Linear scaling performance ismore »« less
Cited by 4
DOI: 10.1021/acs.jctc.6b00154

Full Text Available

Similar Records