ERI sorting for emerging processor architectures

• Published in: Computer physics communications 2009-08, Vol.180 (8), p.1221-1229
• Main Authors: Ramdas, Tirath, Egan, Gregory K., Abramson, David, Baldridge, Kim K.
• Format: Article
• Language: English
• Subjects: Electron repulsion integrals; Hartree–Fock Self-Consistent Field; Single-instruction-multiple-data processing
• ISSN: 0010-4655; 1879-2944
• DOI: 10.1016/j.cpc.2009.01.029

Electron Repulsion Integrals (ERIs) are a common bottleneck in ab initio computational chemistry. It is known that sorted/reordered execution of ERIs results in efficient SIMD/vector processing. This paper shows that reconfigurable computing and heterogeneous processor architectures can also benefit from a deliberate ordering of ERI tasks. However, realizing these benefits as net speedup requires a very rapid sorting mechanism. This paper presents two such mechanisms. Included in this study are analytical, simulation-based, and experimental benchmarking approaches to consider five use cases for ERI sorting, i.e. SIMD processing, reconfigurable computing, limited address spaces, instruction cache exploitation, and data cache exploitation. Specific consideration is given to existing cache-based processors, FPGAs, and the Cell Broadband Engine processor. It is proposed that the analyses conducted in this work should be built upon to aid the development of software autotuners which will produce efficient ab initio computational chemistry codes for a variety of computer architectures.