Acceleration of Hessenberg Reduction for Nonsymmetric Eigenvalue Problems in a Hybrid CPU-GPU Computing Environment
Department of Computational Science & Engineering, Nagoya University, Furo-cho, Chikusa, Nagoya, Aichi, 464-8603, Japan
International Journal of Networking and Computing, Vol 1, No 2, 2011
@article{muramatsu2011acceleration,
title={Acceleration of Hessenberg Reduction for Nonsymmetric Eigenvalue Problems in a Hybrid CPU-GPU Computing Environment},
author={Muramatsu, J. and Fukaya, T. and Zhang, S.L. and Kimura, K. and Yamamoto, Y.},
journal={International Journal of Networking and Computing},
volume={1},
number={2},
pages={pp–132},
year={2011}
}
Solution of large-scale dense nonsymmetric eigenvalue problem is required in many areas of scientific and engineering computing, such as vibration analysis of automobiles and analysis of electronic diffraction patterns. In this study, we focus on the Hessenberg reduction step and consider accelerating it in a hybrid CPU-GPU computing environment. Considering that the Hessenberg reduction algorithm consists almost entirely of BLAS (Basic Linear Algebra Subprograms) operations, we propose three approaches for distributing the BLAS operations between CPU and GPU. Among them, the third approach, which assigns small-size BLAS operations to CPU and distributes large-size BLAS operations between CPU and GPU in some optimal manner, was found to be consistently faster than the other two approaches. On a machine with an Intel Core i7 processor and an NVIDIA Tesla C1060 GPU, this approach achieved 3.2 times speedup over the CPU-only case when computing the Hessenberg form of a 8,192×8,192 real matrix.
November 8, 2011 by hgpu
