Parallelization design on multi-core platforms in density matrix renormalization group toward 2-D quantum strongly-correlated systems

Authors:
Susumu Yamada;Toshiyuki Imamura;Masahiko Machida
Affiliations:
Japan Atomic Energy Agency, Kashiwanoha, Kashiwa-shi, Chiba, Japan;The University of Electro-Communications, Chofugaoka, Chofu-shi, Tokyo, Japan;Japan Atomic Energy Agency, Kashiwanoha, Kashiwa-shi, Chiba, Japan
Venue:
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Year:
2011

Citing 4
Cited 0

Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method

SIAM Journal on Scientific Computing
Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1

Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1
16.447 TFlops and 159-Billion-dimensional Exact-diagonalization for Trapped Fermion-Hubbard Model on the Earth Simulator

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
High Performance Computing for Eigenvalue Solver in Density-Matrix Renormalization Group Method: Parallelization of the Hamiltonian Matrix-Vector Multiplication

High Performance Computing for Computational Science - VECPAR 2008

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most fascinating issues in modern condensed matter physics is to understand highly-correlated electronic structures and propose their novel device designs toward the reduced carbon-dioxide future. Among various developed numerical approaches for highly-correlated electrons, the density matrix renormalization group (DMRG) has been widely accepted as the most promising numerical scheme compared to Monte Carlo and exact diagonalization in terms of accuracy and accessible system size. In fact, DMRG almost perfectly resolves one-dimensional chain like long quantum systems. In this paper, we suggest its extended approach toward higher-dimensional systems by high-performanc computing techniques. The computing target in DMRG is a huge non-uniform sparse matrix diagonalization. In order to efficiently parallelize the part, we implement communication step doubling together with reuse of the mid-point data between the doubled two steps to avoid severe bottleneck of all-to-all communications essential for the diagonalization. The technique is successful even for clusters composed of more than 1000 cores and offers a trustworthy exploration way for two-dimensional highly-correlated systems.