Cart (Loading....) | Create Account
Close category search window
 

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Shixun Zhang ; Sch. of Inf., Kochi Univ. of Technol., Kochi, Japan ; Yamagiwa, S. ; Okumura, M. ; Yunoki, S.

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

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.