Abstract
The adoption of hybrid CPU-GPU nodes in traditional supercomputing platforms such as the Cray-XK6 opens acceleration opportunities for electronic structure calculations in materials science and chemistry applications, where medium-sized generalized eigenvalue problems must be solved many times. These eigenvalue problems are too small to effectively solve on distributed systems, but can benefit from the massive computing power concentrated on a single-node, hybrid CPU-GPU system. However, hybrid systems call for the development of new algorithms that efficiently exploit heterogeneity and massive parallelism of not just GPUs, but of multicore/manycore CPUs as well. Addressing these demands, we developed a generalized eigensolver featuring novel algorithms of increased computational intensity (compared with the standard algorithms), decomposition of the computation into fine-grained memory aware tasks, and their hybrid execution. The resulting eigensolvers are state-of-the-art in high-performance computing, significantly outperforming existing libraries. We describe the algorithm and analyze its performance impact on applications of interest when different fractions of eigenvectors are needed by the host electronic structure code.
Original language | English |
---|---|
Pages (from-to) | 196-209 |
Number of pages | 14 |
Journal | International Journal of High Performance Computing Applications |
Volume | 28 |
Issue number | 2 |
DOIs | |
State | Published - May 2014 |
Funding
This work was supported by the National Science Foundation, the Department of Energy, NVIDIA, and MathWorks.
Funders | Funder number |
---|---|
National Science Foundation | 1339822 |
U.S. Department of Energy | |
NVIDIA |
Keywords
- Eigensolver
- GPU
- electronic structure calculations
- generalized eigensolver
- high performance
- hybrid
- multicore
- two-stage