Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACS symposium series

Parallel Implementation of the Electronic Structure Code GAMESS

Theresa L. Windus, Michael W. Schmidt, Mark S. Gordon

Published May 17, 1995• 7 citations
Publisher

Abstract

This paper outlines various tools and techniques for the parallelization of quantum chemistry codes; in particular, for the electronic structure code GAMESS. A general overview of the parallel capabilities of GAMESS are also presented. The parallelization of quantum chemistry codes has become a very active area of research over the last decade( 1, 2, 3, 4 ). Until recently, most of this research has dealt with self-consistent field (SCF) theory( 1 ). However, in the last few years parallel implementations of post-SCF methods have been presented ( 2 ). Most of the post-SCF methods and analytic Hessians for SCF wavefunctions face the substantial problem of parallelizing the atomic orbital (AO) integral to molecular orbital (MO) integral transformation ( 3 ). The objective of this paper is to provide general information about the parallel implementation of GAMESS. The following sections are presented in this paper: (A) a brief overview of the functionality of the ab initio code GAMESS (General Atomic and Molecular Electronic Structure System); (B) a short discussion of the model, software, and general ideas used to parallelize GAMESS; (C) spécifics concerning the parallelization of the SCF; (D) discussion concerning the AO to MO integral transformation; (E) the transformation as applied to multi-configuration SCF (MCSCF); (F) the transformation as applied to analytic Hessians; (G) a brief overview of the parallel MP2 code; and (H) conclusions and future areas of research will be discussed.

DOI
10.1021/bk-1995-0592.ch002

Related papers

Enabling Chemistry Applications with High Performance Computing

Mark S. Gordon

Advances in computer hardware have pushed forward the size of chemical investigations that are accessible using quantum chemistry. However, because state-of-the-art quantum chemistry methods scale as N 5 - N7, the hardware advances can only take us so far. A key advance in the past decade has been the development of scalable (parallel) codes for highly correlated wavefunctions. Following a summary of the methods used in our approach to parallelism in GAMESS (General Atomic and Molecular Electronic Structure System), several applications that emphasize the efficiacy of scalable codes will be discussed. These include the prediction of potential new fuels, the study of new materials with desirable properties and the study of species of biological importance

Kluwer Academic Publishers eBooks•Dec 29, 2005•0 citations

Development of Efficient Algorithms for Quantum Chemistry Calculations of Large Molecules

和也 石村, カズヤ イシムラ, Kazuya Ishimura

Quantum chemistry plays an important role in elucidating molecular geometries, electronic states, and reaction mechanisms, because of the developments of a variety of theoretical methods, such as Hartree-Fock (HF), Møler-Plesset (MP) perturbation, configuration interaction (CI), coupled-cluster (CC), and density functional theory (DFT) methods. Electronic structure calculations have been carried out by not only theoretical chemists but also experimental chemists. DFT is currently most widely used to investigate large molecules in the ground state as well as small molecules because of the low computational cost. However, the generally used functionals fail to describe correctly non-covalent interactions that are important for host-guest molecules, self-assembly, and molecular recognition, and they tend to underestimate reaction barriers. Many attempts have been made to develop new functionals and add semiempirical or empirical correction terms to standard functionals, but no generally accepted DFT method has emerged yet. Second-order Møler-Plesset perturbation theory (MP2) is the simplest method that includes electron correlation important for non-covalent interactions and reaction barriers nonempirically. However, the computational cost of MP2 is considerably higher than that of DFT. In addition, much larger sizes of fast memory and hard disk are required in MP2 calculations. These make MP2 calculations increasingly difficult for larger molecules. Since workstation or personal computer (PC) clusters have become popular for quantum chemistry calculations, an efficient parallel calculation is a solution of the problem. Therefore, new parallel algorithms for MP2 energy and gradient calculations are presented in this thesis. Furthermore, an efficient algorithm for the generation of two-electron repulsion integrals (ERIs) which is important in quantum chemistry calculations is also presented. For the calculations of excited states, different approaches are required: for example, CI, multi-configuration self-consistent field (MCSCF), time-dependent DFT (TDDFT), and symmetry adapted cluster (SAC)/SAC-CI methods. One of the most accurate methods is SAC/SAC-CI, as demonstrated for many molecules. In this thesis, SAC/SAC-CI calculations of ground, ionized, and excited states are presented. This thesis consists of five chapters: a new algorithm of two-electron repulsion integral calculations (Chapter I), a new parallel algorithm of MP2 energy calculations (Chapter II), a new parallel algorithm of MP2 energy gradient calculations (Chapter III), applications of MP2 calculations (Chapter IV), and SAC/SAC-CI calculations of ionized and excited states (Chapter V). In quantum chemistry calculations, the generation of ERIs is one of the most basic subjects and is the most time-consuming step especially in direct SCF calculations. Many algorithms have been developed to reduce the computational cost. In Pople-Hehre algorithm, Cartesian axes are rotated to make several coordinate components zero or constant, so that these components are skipped in the generation of ERIs. In McMurchie-Davidson algorithm, ERIs are generated from (ss|ss) type integrals using a recurrence relation derived from Hermite polynomials. By combining these two algorithms, a new algorithm is developed in Chapter I. The results show that the new algorithm reduces the computational cost by 10 - 40%, as compared with the original algorithms. It is notable that the generation of ERIs including d functions is considerably fast. The program implemented officially in GAMESS in 2004 has been used all over the world. In quantum mechanics, perturbation methods can be used for adding corrections to reference solutions. In the MP perturbation method, a sum over Fock operators is used as the reference term, and the exact two-electron repulsion operator minus twice the average two-electron repulsion operator is used as the perturbation term. It is the advantage that the MP perturbation method is size consistent and size extensive, unlike truncated CI methods. The zero-order wave function is the HF Slater determinant, and the zero-order energy is expressed as a sum of occupied molecular orbital (MO) energies. The first-order perturbation is the correction for the overcounting of two-electron repulsions at zero-order, and the first-order energy corresponds to the HF energy. The MP correlation starts at second-order. In general, second-order (MP2) accounts for 80 - 90% of electron correlation. Therefore, MP2 is focused in this thesis since it is applicable to large molecules with considerable reliability and low computational cost. The formal computational scaling of MP2 energy calculations with respect to molecular size is fifth order, much higher than that of DFT energy calculations. Therefore, less expensive methods, such as Local MP2, density fitting (resolution of identity, RI) MP2, and Laplace Transform MP2, have been developed. However, all of these methods include approximations or cut-offs that need to be checked against full MP2 energies. An alternative approach to reduce the computational cost is to parallelize MP2 energy calculations. A number of papers on parallel MP2 energy calculations have been published. Almost all of them are based on simple parallelization methods that distribute only atomic orbital (AO) or MO indices to each processor. These methods have a disadvantage since intermediate integrals are broadcasted to all CPUs or the same AO ERIs are generated in all processors. Baker and Pulay developed a new parallel algorithm using SaebøAlmlöf integral transformation method. This algorithm parallelizes the first half transformation by AO indices and the second half transformation by MO indices. The advantages are that the total amount of network communication is independent of the number of processors and the AO integrals are generated only once. The disadvantage is the I/O overhead for the sorting of half-transformed integrals. A new parallel algorithm for MP2 energy calculations based on the two-step parallelization idea is presented in Chapter II. In this algorithm, AO indices are distributed in the AO integral generation and the first three quarter transformation, and MO indices are distributed in the last quarter transformation and MP2 energy calculation. Because the algorithm makes the sorting of intermediate integrals very simple, the parallel efficiency is highly improved and the I/O overhead is removed. Furthermore, the algorithm reduces highly the floating point operation (FLOP) count as well as the required memory and hard disk space, in comparison with other algorithms. Test calculations of taxol (C47H51NO14) and luciferin (C11H8N2O3S2) were performed on a cluster of Pentium 4 computers connected by gigabit Ethernet. The parallel scaling of the developed code is excellent up to the largest number of processors we have tested. For instance, the elapsed time for the MP2 energy calculations on 16 processors is on average 15.4 times faster than that on the single-processor. Determination of molecular geometries and reaction paths is a fundamental task in quantum chemistry and requires energy gradients with respect to nuclear coordinates. In Chapter III, a new parallel algorithm for MP2 energy gradient calculations is presented. The algorithm consists of 5 steps, the integral transformation, the MP2 amplitude calculation, the MP2 Lagrangian calculation, the coupled-perturbed HF calculation, and the integral derivative calculation. All steps are parallelized by distributing AO or MO indices. The algorithm also reduces the FLOP count, the required memory, and hard disk space. Test calculations of MP2 energy gradients were performed for taxol and luciferin on a cluster of Pentium 4 computers. The speedups are very good up to 80 CPU cores we have tested. For instance, the speedup ratios are 28.2 - 33.0 on 32 processors, corresponding to 88% - 103% of linear speedup. This indicates the high parallel efficiency of the present algorithm. The calculation of taxol with 6-31G(d) (1032 contracted basis functions) finishes within 2 hours on 32 processors, which requires only 1.8GB memory and 13.4GB hard disk per processor. Therefore, geometry optimization of molecules with 1000 basis functions can be easily performed using standard PC clusters. In Chapter IV, several applications of MP2 are performed using the program developed in Chapters II and III. Some molecules that DFT cannot treat well are optimized at the MP2 level. Geometry optimization is also carried out using the spin-component scaled (SCS) MP2 method. In this method, a different scaling is employed for the same and opposite spin components of the MP2 energy, so that SCS-MP2 performs as well as the much more costly CCSD(T) method at a high level of theory. SAC theory is developed for ground states and based on CC theory that describes higher-order electron correlation. The main factor of electron correlation is collisions of two electrons. In CC theory, most collisions of four electrons can be taken in as the product of collisions of tw

•Sep 28, 2007•0 citations

Parallel implementation of electronic structure energy, gradient, and Hessian calculations

Victor F. Lotrich, Norbert Flocke, Mark Ponton +4 more

ACES III is a newly written program in which the computationally demanding components of the computational chemistry code ACES II [J. F. Stanton et al., Int. J. Quantum Chem. 526, 879 (1992); [ACES II program system, University of Florida, 1994] have been redesigned and implemented in parallel. The high-level algorithms include Hartree-Fock (HF) self-consistent field (SCF), second-order many-body perturbation theory [MBPT(2)] energy, gradient, and Hessian, and coupled cluster singles, doubles, and perturbative triples [CCSD(T)] energy and gradient. For SCF, MBPT(2), and CCSD(T), both restricted HF and unrestricted HF reference wave functions are available. For MBPT(2) gradients and Hessians, a restricted open-shell HF reference is also supported. The methods are programed in a special language designed for the parallelization project. The language is called super instruction assembly language (SIAL). The design uses an extreme form of object-oriented programing. All compute intensive operations, such as tensor contractions and diagonalizations, all communication operations, and all input-output operations are handled by a parallel program written in C and FORTRAN 77. This parallel program, called the super instruction processor (SIP), interprets and executes the SIAL program. By separating the algorithmic complexity (in SIAL) from the complexities of execution on computer hardware (in SIP), a software system is created that allows for very effective optimization and tuning on different hardware architectures with quite manageable effort.

The Journal of Chemical Physics•May 20, 2008•173 citations

Quantum Chemistry on Graphical Processing Units. 2. Direct Self-Consistent-Field Implementation

Ivan S. Ufimtsev, Todd J. Martínez

We demonstrate the use of graphical processing units (GPUs) to carry out complete self-consistent-field calculations for molecules with as many as 453 atoms (2131 basis functions). Speedups ranging from 28× to 650× are achieved as compared to a mature third-party quantum chemistry program (GAMESS) running on a traditional CPU. The computational organization used to construct the Coulomb and exchange operators is discussed. We also present results using three GPUs in parallel, combining coarse and fine-grained parallelism.

Journal of Chemical Theory and Computation•Mar 6, 2009•457 citations

Quantum supercharger library: Hyper-parallelism of the Hartree-Fock method

Kyle D. Fernandes, C. Alicia Renison, Kevin J. Naidoo

We present here a set of algorithms that completely rewrites the Hartree-Fock (HF) computations common to many legacy electronic structure packages (such as GAMESS-US, GAMESS-UK, and NWChem) into a massively parallel compute scheme that takes advantage of hardware accelerators such as Graphical Processing Units (GPUs). The HF compute algorithm is core to a library of routines that we name the Quantum Supercharger Library (QSL). We briefly evaluate the QSL's performance and report that it accelerates a HF 6-31G Self-Consistent Field (SCF) computation by up to 20 times for medium sized molecules (such as a buckyball) when compared with mature Central Processing Unit algorithms available in the legacy codes in regular use by researchers. It achieves this acceleration by massive parallelization of the one- and two-electron integrals and optimization of the SCF and Direct Inversion in the Iterative Subspace routines through the use of GPU linear algebra libraries. © 2015 Wiley Periodicals, Inc.

Journal of Computational Chemistry•May 14, 2015•10 citations

GAMESS, GPUs, JuliaChem, and Julia: a double date in high-performance quantum chemistry

David C. Poole

The first chapter in this thesis describes the theoretical framework that underlies much of electronic structure theory. The second chapter provides a review of the modern state of the intersection between electronic structure theory and high-performance computing. The next four chapters describe the development and implementation of new code into the GAMESS software package that utilizes Graphics Processing Units (GPUs) to achieve optimal performance. Chapter Three discusses an initial implementation of the GPU-driven Fock build step for the Restricted Hartree-Fock (RHF) method and the subsequent performance analysis on the Summit supercomputer. Chapter Four describes further developments to the aforementioned GPU-driven RHF Fock build code. Chapter Five discusses the extension of the GPU-driven RHF Fock build algorithm to the entirety of the Self-Consistent Field (SCF) process, which enables multiple steps of the SCF process to utilize GPUs. Chapter Six discusses the development of a new, GPU-driven algorithm for the Møller-Plesset Second-Order Perturbation Theory method (MP2) using the Resolution of the Identity (RI) and a subsequent performance analysis of the new RI-MP2 algorithm on the Summit Supercomputer. The next two chapters discuss the development of JuliaChem, a new electronic structure theory software package implemented in the Julia programming language. Chapter Seven provides an initial performance assessment of the RHF SCF algorithm implemented in Julia compared to GAMESS. Chapter Eight describes further algorithmic developments to the JuliaChem RHF algorithm and provides a performance analysis compared to modern developments in the GAMESS code. Chapter Nine provides an analysis of the ethylenedione molecule and its inherently unstable nature using multiple theoretical methods. Chapter Ten, the final chapter of the dissertation, provides final concluding thoughts.

•Jan 1, 2021•0 citations
This paper outlines various tools and techniques for the parallelization of quantum chemistry codes; in particular, for the electronic structure code GAMESS. A general overview of the parallel capabilities of GAMESS are also presented. The parallelization of quantum chemistry codes has become a very active area of research over the last decade( 1, 2, 3, 4 ). Until recently, most of this research has dealt with self-consistent field (SCF) theory( 1 ). However, in the last few years parallel implementations of post-SCF methods have been presented ( 2 ). Most of the post-SCF methods and analytic Hessians for SCF wavefunctions face the substantial problem of parallelizing the atomic orbital (AO) integral to molecular orbital (MO) integral transformation ( 3 ). The objective of this paper is to provide general information about the parallel implementation of GAMESS. The following sections are presented in this paper: (A) a brief overview of the functionality of the ab initio code GAMESS (General Atomic and Molecular Electronic Structure System); (B) a short discussion of the model, software, and general ideas used to parallelize GAMESS; (C) spécifics concerning the parallelization of the SCF; (D) discussion concerning the AO to MO integral transformation; (E) the transformation as applied to multi-configuration SCF (MCSCF); (F) the transformation as applied to analytic Hessians; (G) a brief overview of the parallel MP2 code; and (H) conclusions and future areas of research will be discussed.
Advances in computer hardware have pushed forward the size of chemical investigations that are accessible using quantum chemistry. However, because state-of-the-art quantum chemistry methods scale as N 5 - N7, the hardware advances can only take us so far. A key advance in the past decade has been the development of scalable (parallel) codes for highly correlated wavefunctions. Following a summary of the methods used in our approach to parallelism in GAMESS (General Atomic and Molecular Electronic Structure System), several applications that emphasize the efficiacy of scalable codes will be discussed. These include the prediction of potential new fuels, the study of new materials with desirable properties and the study of species of biological importance
Quantum chemistry plays an important role in elucidating molecular geometries, electronic states, and reaction mechanisms, because of the developments of a variety of theoretical methods, such as Hartree-Fock (HF), Møler-Plesset (MP) perturbation, configuration interaction (CI), coupled-cluster (CC), and density functional theory (DFT) methods. Electronic structure calculations have been carried out by not only theoretical chemists but also experimental chemists. DFT is currently most widely used to investigate large molecules in the ground state as well as small molecules because of the low computational cost. However, the generally used functionals fail to describe correctly non-covalent interactions that are important for host-guest molecules, self-assembly, and molecular recognition, and they tend to underestimate reaction barriers. Many attempts have been made to develop new functionals and add semiempirical or empirical correction terms to standard functionals, but no generally accepted DFT method has emerged yet. Second-order Møler-Plesset perturbation theory (MP2) is the simplest method that includes electron correlation important for non-covalent interactions and reaction barriers nonempirically. However, the computational cost of MP2 is considerably higher than that of DFT. In addition, much larger sizes of fast memory and hard disk are required in MP2 calculations. These make MP2 calculations increasingly difficult for larger molecules. Since workstation or personal computer (PC) clusters have become popular for quantum chemistry calculations, an efficient parallel calculation is a solution of the problem. Therefore, new parallel algorithms for MP2 energy and gradient calculations are presented in this thesis. Furthermore, an efficient algorithm for the generation of two-electron repulsion integrals (ERIs) which is important in quantum chemistry calculations is also presented. For the calculations of excited states, different approaches are required: for example, CI, multi-configuration self-consistent field (MCSCF), time-dependent DFT (TDDFT), and symmetry adapted cluster (SAC)/SAC-CI methods. One of the most accurate methods is SAC/SAC-CI, as demonstrated for many molecules. In this thesis, SAC/SAC-CI calculations of ground, ionized, and excited states are presented. This thesis consists of five chapters: a new algorithm of two-electron repulsion integral calculations (Chapter I), a new parallel algorithm of MP2 energy calculations (Chapter II), a new parallel algorithm of MP2 energy gradient calculations (Chapter III), applications of MP2 calculations (Chapter IV), and SAC/SAC-CI calculations of ionized and excited states (Chapter V). In quantum chemistry calculations, the generation of ERIs is one of the most basic subjects and is the most time-consuming step especially in direct SCF calculations. Many algorithms have been developed to reduce the computational cost. In Pople-Hehre algorithm, Cartesian axes are rotated to make several coordinate components zero or constant, so that these components are skipped in the generation of ERIs. In McMurchie-Davidson algorithm, ERIs are generated from (ss|ss) type integrals using a recurrence relation derived from Hermite polynomials. By combining these two algorithms, a new algorithm is developed in Chapter I. The results show that the new algorithm reduces the computational cost by 10 - 40%, as compared with the original algorithms. It is notable that the generation of ERIs including d functions is considerably fast. The program implemented officially in GAMESS in 2004 has been used all over the world. In quantum mechanics, perturbation methods can be used for adding corrections to reference solutions. In the MP perturbation method, a sum over Fock operators is used as the reference term, and the exact two-electron repulsion operator minus twice the average two-electron repulsion operator is used as the perturbation term. It is the advantage that the MP perturbation method is size consistent and size extensive, unlike truncated CI methods. The zero-order wave function is the HF Slater determinant, and the zero-order energy is expressed as a sum of occupied molecular orbital (MO) energies. The first-order perturbation is the correction for the overcounting of two-electron repulsions at zero-order, and the first-order energy corresponds to the HF energy. The MP correlation starts at second-order. In general, second-order (MP2) accounts for 80 - 90% of electron correlation. Therefore, MP2 is focused in this thesis since it is applicable to large molecules with considerable reliability and low computational cost. The formal computational scaling of MP2 energy calculations with respect to molecular size is fifth order, much higher than that of DFT energy calculations. Therefore, less expensive methods, such as Local MP2, density fitting (resolution of identity, RI) MP2, and Laplace Transform MP2, have been developed. However, all of these methods include approximations or cut-offs that need to be checked against full MP2 energies. An alternative approach to reduce the computational cost is to parallelize MP2 energy calculations. A number of papers on parallel MP2 energy calculations have been published. Almost all of them are based on simple parallelization methods that distribute only atomic orbital (AO) or MO indices to each processor. These methods have a disadvantage since intermediate integrals are broadcasted to all CPUs or the same AO ERIs are generated in all processors. Baker and Pulay developed a new parallel algorithm using SaebøAlmlöf integral transformation method. This algorithm parallelizes the first half transformation by AO indices and the second half transformation by MO indices. The advantages are that the total amount of network communication is independent of the number of processors and the AO integrals are generated only once. The disadvantage is the I/O overhead for the sorting of half-transformed integrals. A new parallel algorithm for MP2 energy calculations based on the two-step parallelization idea is presented in Chapter II. In this algorithm, AO indices are distributed in the AO integral generation and the first three quarter transformation, and MO indices are distributed in the last quarter transformation and MP2 energy calculation. Because the algorithm makes the sorting of intermediate integrals very simple, the parallel efficiency is highly improved and the I/O overhead is removed. Furthermore, the algorithm reduces highly the floating point operation (FLOP) count as well as the required memory and hard disk space, in comparison with other algorithms. Test calculations of taxol (C47H51NO14) and luciferin (C11H8N2O3S2) were performed on a cluster of Pentium 4 computers connected by gigabit Ethernet. The parallel scaling of the developed code is excellent up to the largest number of processors we have tested. For instance, the elapsed time for the MP2 energy calculations on 16 processors is on average 15.4 times faster than that on the single-processor. Determination of molecular geometries and reaction paths is a fundamental task in quantum chemistry and requires energy gradients with respect to nuclear coordinates. In Chapter III, a new parallel algorithm for MP2 energy gradient calculations is presented. The algorithm consists of 5 steps, the integral transformation, the MP2 amplitude calculation, the MP2 Lagrangian calculation, the coupled-perturbed HF calculation, and the integral derivative calculation. All steps are parallelized by distributing AO or MO indices. The algorithm also reduces the FLOP count, the required memory, and hard disk space. Test calculations of MP2 energy gradients were performed for taxol and luciferin on a cluster of Pentium 4 computers. The speedups are very good up to 80 CPU cores we have tested. For instance, the speedup ratios are 28.2 - 33.0 on 32 processors, corresponding to 88% - 103% of linear speedup. This indicates the high parallel efficiency of the present algorithm. The calculation of taxol with 6-31G(d) (1032 contracted basis functions) finishes within 2 hours on 32 processors, which requires only 1.8GB memory and 13.4GB hard disk per processor. Therefore, geometry optimization of molecules with 1000 basis functions can be easily performed using standard PC clusters. In Chapter IV, several applications of MP2 are performed using the program developed in Chapters II and III. Some molecules that DFT cannot treat well are optimized at the MP2 level. Geometry optimization is also carried out using the spin-component scaled (SCS) MP2 method. In this method, a different scaling is employed for the same and opposite spin components of the MP2 energy, so that SCS-MP2 performs as well as the much more costly CCSD(T) method at a high level of theory. SAC theory is developed for ground states and based on CC theory that describes higher-order electron correlation. The main factor of electron correlation is collisions of two electrons. In CC theory, most collisions of four electrons can be taken in as the product of collisions of tw
ACES III is a newly written program in which the computationally demanding components of the computational chemistry code ACES II [J. F. Stanton et al., Int. J. Quantum Chem. 526, 879 (1992); [ACES II program system, University of Florida, 1994] have been redesigned and implemented in parallel. The high-level algorithms include Hartree-Fock (HF) self-consistent field (SCF), second-order many-body perturbation theory [MBPT(2)] energy, gradient, and Hessian, and coupled cluster singles, doubles, and perturbative triples [CCSD(T)] energy and gradient. For SCF, MBPT(2), and CCSD(T), both restricted HF and unrestricted HF reference wave functions are available. For MBPT(2) gradients and Hessians, a restricted open-shell HF reference is also supported. The methods are programed in a special language designed for the parallelization project. The language is called super instruction assembly language (SIAL). The design uses an extreme form of object-oriented programing. All compute intensive operations, such as tensor contractions and diagonalizations, all communication operations, and all input-output operations are handled by a parallel program written in C and FORTRAN 77. This parallel program, called the super instruction processor (SIP), interprets and executes the SIAL program. By separating the algorithmic complexity (in SIAL) from the complexities of execution on computer hardware (in SIP), a software system is created that allows for very effective optimization and tuning on different hardware architectures with quite manageable effort.
We demonstrate the use of graphical processing units (GPUs) to carry out complete self-consistent-field calculations for molecules with as many as 453 atoms (2131 basis functions). Speedups ranging from 28× to 650× are achieved as compared to a mature third-party quantum chemistry program (GAMESS) running on a traditional CPU. The computational organization used to construct the Coulomb and exchange operators is discussed. We also present results using three GPUs in parallel, combining coarse and fine-grained parallelism.
We present here a set of algorithms that completely rewrites the Hartree-Fock (HF) computations common to many legacy electronic structure packages (such as GAMESS-US, GAMESS-UK, and NWChem) into a massively parallel compute scheme that takes advantage of hardware accelerators such as Graphical Processing Units (GPUs). The HF compute algorithm is core to a library of routines that we name the Quantum Supercharger Library (QSL). We briefly evaluate the QSL's performance and report that it accelerates a HF 6-31G Self-Consistent Field (SCF) computation by up to 20 times for medium sized molecules (such as a buckyball) when compared with mature Central Processing Unit algorithms available in the legacy codes in regular use by researchers. It achieves this acceleration by massive parallelization of the one- and two-electron integrals and optimization of the SCF and Direct Inversion in the Iterative Subspace routines through the use of GPU linear algebra libraries. © 2015 Wiley Periodicals, Inc.
The first chapter in this thesis describes the theoretical framework that underlies much of electronic structure theory. The second chapter provides a review of the modern state of the intersection between electronic structure theory and high-performance computing. The next four chapters describe the development and implementation of new code into the GAMESS software package that utilizes Graphics Processing Units (GPUs) to achieve optimal performance. Chapter Three discusses an initial implementation of the GPU-driven Fock build step for the Restricted Hartree-Fock (RHF) method and the subsequent performance analysis on the Summit supercomputer. Chapter Four describes further developments to the aforementioned GPU-driven RHF Fock build code. Chapter Five discusses the extension of the GPU-driven RHF Fock build algorithm to the entirety of the Self-Consistent Field (SCF) process, which enables multiple steps of the SCF process to utilize GPUs. Chapter Six discusses the development of a new, GPU-driven algorithm for the Møller-Plesset Second-Order Perturbation Theory method (MP2) using the Resolution of the Identity (RI) and a subsequent performance analysis of the new RI-MP2 algorithm on the Summit Supercomputer. The next two chapters discuss the development of JuliaChem, a new electronic structure theory software package implemented in the Julia programming language. Chapter Seven provides an initial performance assessment of the RHF SCF algorithm implemented in Julia compared to GAMESS. Chapter Eight describes further algorithmic developments to the JuliaChem RHF algorithm and provides a performance analysis compared to modern developments in the GAMESS code. Chapter Nine provides an analysis of the ethylenedione molecule and its inherently unstable nature using multiple theoretical methods. Chapter Ten, the final chapter of the dissertation, provides final concluding thoughts.