Abstract

AbstractA coarse‐grain, parallel approach to direct Hartree–Fock calculations is presented and discussed. The suggested scheme allows for a near asymptotic speedup involving a very low parallelization overhead without compromising the vector performance of vector‐parallel architectures. A shared‐memory MIMD implementation, for which very high speeds of computation have been achieved, is discussed in detail.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.