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

Ghale, Purnima; Kroonblawd, Matthew P.; Mniszewski, Sue; Negre, Christian F.  A.; Pavel, Robert; Pino, Sergio; Sardeshmukh, Vivek; Shi, Guangjie; Hahn, Georg

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.  https://doi.org/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.  https://doi.org/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

https://doi.org/10.1137/16M109404X

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 1 work

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Parallel Algorithms for Graph Optimization using Tree Decompositions

Technical Report Sullivan, Blair D ; Weerapurage, Dinesh P ; Groer, Christopher S

Although manymore »« less
https://doi.org/10.2172/1042920

Full Text Available
Parallel Algorithms for Graph Optimization using Tree Decompositions

Conference Weerapurage, Dinesh P ; Sullivan, Blair D ; Groer, Christopher S

Although many NP-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of required dynamic programming tables and excessive running times of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree-decomposition based approach to solve maximum weighted independent set. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables amore »« less
Applying graph partitioning methods in measurement-based dynamic load balancing

Technical Report Bhatele, Abhinav ; Fourestier, Sebastien ; Menon, Harshitha ; ...

Load imbalance leads to an increasing waste of resources as an application is scaled to more and more processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. However, finding near-optimal solutions to this problem for complex computational science and engineering applications is becoming increasingly important. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing framework. This framework instruments and then migrates over-decomposed objects to balance computational load and communication at runtime. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, formore »« less
https://doi.org/10.2172/1114706

Full Text Available
Steps toward fault-tolerant quantum chemistry.

Technical Report Taube, Andrew Garvin

Developing quantum chemistry programs on the coming generation of exascale computers will be a difficult task. The programs will need to be fault-tolerant and minimize the use of global operations. This work explores the use a task-based model that uses a data-centric approach to allocate work to different processes as it applies to quantum chemistry. After introducing the key problems that appear when trying to parallelize a complicated quantum chemistry method such as coupled-cluster theory, we discuss the implications of that model as it pertains to the computational kernel of a coupled-cluster program - matrix multiplication. Also, we discuss themore »« less
https://doi.org/10.2172/992330

Full Text Available
A Novel Coarsening Method for Scalable and Efficient Mesh Generation

Technical Report Yoo, A ; Hysom, D ; Gunney, B

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicatemore »« less
https://doi.org/10.2172/1018444

Full Text Available

Similar Records