6885

Parallelizing Kernel Polynomial Method Applying Graphics Processing Units

Shixun Zhang, Shinichi Yamagiwa, Masahiko Okumura, Seiji Yunoki
School of Information, Kochi University of Technology/JST PRESTO, Kami, Kochi 782-8502 Japan
International Journal of Networking and Computing, Vol 2, No 1, 2012

@article{zhang2012parallelizing,

   title={Parallelizing Kernel Polynomial Method Applying Graphics Processing Units},

   author={Zhang, S. and Yamagiwa, S. and Okumura, M. and Yunoki, S.},

   journal={International Journal of Networking and Computing},

   volume={2},

   number={1},

   pages={pp–41},

   year={2012}

}

Download Download (PDF)   View View   Source Source   

538

views

The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a cluster computer or a supercomputer due to the fine-grain recursive calculations. This paper proposes an implementation of the KPM on the recent graphics processing units (GPU) where the recursive calculations are able to be parallelized in the massively parallel environment. This paper also describes performance evaluations regarding the cases when the actual simulation parameters are applied, where one parameter is applied for the increased intensive calculations and another is applied for the increased amount of memory usage. Moreover, the impact for applying the Compress Row Storage (CRS) format to the KPM algorithm is also discussed. Finally, it concludes that the performance on the GPU promises very high performance compared to the one on CPU and reduces the overall simulation time.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: