2013年2月
Kernel Polynomial Method on GPU
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
- ,
- ,
- ,
- 巻
- 41
- 号
- 1
- 開始ページ
- 59
- 終了ページ
- 88
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1007/s10766-012-0204-y
- 出版者・発行元
- SPRINGER/PLENUM PUBLISHERS
The simulation of lattice model systems for quantum materials is one of the most important approaches to understand quantum properties of matter in condensed matter physics. The main task in the simulation is to diagonalize a Hamiltonian matrix for the system and evaluate the electronic density of energy states. Kernel polynomial method (KPM) is one of the promising simulation methods. Because KPM contains a fine-grain recursive part in the algorithm, it is hard to parallelize it under the thread level parallelism such as on a supercomputer or a cluster computer. This paper focuses on methods to parallelize KPM on a massively parallel environment of GPU, aiming to achieve high parallelism for more speedups than the recent CPUs. This paper proposes two implementation methods called the full map and the sliding window methods, and evaluates the performances in the recent GPU platform. To enlarge available simulation sizes and at the same time to enhance the performance, this paper also describes additional optimization techniques depending on the GPU architecture.
- リンク情報
- ID情報
-
- DOI : 10.1007/s10766-012-0204-y
- ISSN : 0885-7458
- Web of Science ID : WOS:000313061500002