Linear scaling computation of the Fock matrix. IX. Parallel computation of the Coulomb matrix

Physics – Condensed Matter – Other Condensed Matter

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 6 figures

Scientific paper

10.1063/1.1790891

We present parallelization of a quantum-chemical tree-code [J. Chem. Phys. {\bf 106}, 5526 (1997)] for linear scaling computation of the Coulomb matrix. Equal time partition [J. Chem. Phys. {\bf 118}, 9128 (2003)] is used to load balance computation of the Coulomb matrix. Equal time partition is a measurement based algorithm for domain decomposition that exploits small variation of the density between self-consistent-field cycles to achieve load balance. Efficiency of the equal time partition is illustrated by several tests involving both finite and periodic systems. It is found that equal time partition is able to deliver 91 -- 98 % efficiency with 128 processors in the most time consuming part of the Coulomb matrix calculation. The current parallel quantum chemical tree code is able to deliver 63 -- 81% overall efficiency on 128 processors with fine grained parallelism (less than two heavy atoms per processor).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Linear scaling computation of the Fock matrix. IX. Parallel computation of the Coulomb matrix does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear scaling computation of the Fock matrix. IX. Parallel computation of the Coulomb matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear scaling computation of the Fock matrix. IX. Parallel computation of the Coulomb matrix will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-59106

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.