PaSTRI: Error-Bounded Lossy Compression for Two-Electron Integrals in Quantum Chemistry
Abstract
Computation of two-electron repulsion integrals is the critical and the most time-consuming step in a typical parallel quantum chemistry simulation. Such calculations have massive computing and storage requirements, which scale as 𝒪(N4) with the size of a chemical system. Compressing the integral's data and storing it on disk can avoid costly recalculation, significantly speeding the overall quantum chemistry calculations; but it requires a fast compression algorithm. To this end, we developed PaSTRI (Pattern Scaling for Two-electron Repulsion Integrals) and implemented the algorithm in the data compression package SZ. PaSTRI leverages the latent pattern features in the integral dataset and optimizes the calculation of the appropriate number of bits required for the storage of the integral. We have evaluated PaSTRI using integral datasets generated by the quantum chemistry program GAMESS. The results show an excellent 16.8 compression ratio with low overhead, while maintaining 10-10 absolute precision based on user's requirement.
Recommended Citation
A. Gok et al., "PaSTRI: Error-Bounded Lossy Compression for Two-Electron Integrals in Quantum Chemistry," Proceedings of the IEEE International Conference on Cluster Computing, ICCC, pp. 1 - 11, Institute of Electrical and Electronics Engineers (IEEE), Oct 2018.
The definitive version is available at https://doi.org/10.1109/CLUSTER.2018.00013
Meeting Name
2018 IEEE International Conference on Cluster Computing, ICCC (2018: Sep. 10-13, Belfast, UK)
Department(s)
Computer Science
Keywords and Phrases
ERI; Lossy Compression; Quantum Chemistry; Two-Electron Repulsion Integral
International Standard Book Number (ISBN)
978-153868319-4
International Standard Serial Number (ISSN)
1552-5244
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2018 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
29 Oct 2018
Comments
This research was supported by the Exascale Computing Project (ECP), Project Number: 17-SC-20-SC. This research is also supported by the National Science Foundation under Grant No. 1619253.