By Topic

Performance Impact Applying Compression Format to Sparse Matrix on Kernel Polynomial Method Using GPU

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shixun Zhang ; Sch. of Inf., Kochi Univ. of Technol., Kochi, Japan ; Shinichi Yamagiwa ; Masahiko Okumura ; Seiji Yunoki

Kernel Polynomial Method (KPM) is an efficient method used for simulations of crystal lattice system in research field of condensed matter physics and chemistry. KPM involves matrix operations such as matrix-vector multiplication in which the storage format of the matrix has a great impact not only on the performance of KPM but also the memory consumption. This paper proposes an implementation of the KPM on the recent graphics processing units (GPU) where the CRS format is applied to the matrix. This paper also illustrates performance evaluation of the implementation of GPU and that of CPU. We also compare performances among the cases with/without the CRS format in KPM. The evaluation shows that the GPU-based implementation achieves several times better performance than the CPU-based one.

Published in:

Networking and Computing (ICNC), 2011 Second International Conference on

Date of Conference:

Nov. 30 2011-Dec. 2 2011