首页 | 本学科首页   官方微博 | 高级检索  
     检索      

密度矩阵重正化群的异构并行优化
引用本文:陈富州,程晨,罗洪刚.密度矩阵重正化群的异构并行优化[J].物理学报,1980,68(12):120202-120202.
作者姓名:陈富州  程晨  罗洪刚
作者单位:1. 兰州大学物理科学与技术学院, 兰州 730000; 2. 北京计算科学研究中心, 北京 100084
基金项目:国家自然科学基金(批准号:11674139,11834005)和长江学者和创新团队发展计划(批准号:IRT-16R35)资助的课题.
摘    要:密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.

关 键 词:密度矩阵重正化群  强关联格点模型  异构并行
收稿时间:2019-04-22

Hybrid parallel optimization of density matrix renormalization group method
Chen Fu-Zhou,Cheng Chen,Luo Hong-Gang.Hybrid parallel optimization of density matrix renormalization group method[J].Acta Physica Sinica,1980,68(12):120202-120202.
Authors:Chen Fu-Zhou  Cheng Chen  Luo Hong-Gang
Institution:1. School of Physical Science and Technology, Lanzhou University, Lanzhou 730000, China; 2. Beijing Computational Science Research Center, Beijing 100084, China
Abstract:Density matrix renormalization group (DMRG), as a numerical method of solving the ground state of one-dimensional strongly-correlated lattice model with very high accuracy, requires expensive computational and memory cost when applied to two-and quasi-two-dimensional problems. The number of DMRG kept states is generally very large to achieve a reliable accuracy for these applications, which results in numerous matrix and vector operations and unbearably consuming time in the absence of the proper parallelization. However, due to its sequential nature, the parallelization of DMRG algorithm is usually not straightforward. In this work, we propose a new hybrid parallelization strategy for the DMRG method. It takes advantage of the computing capability of both central processing unit (CPU) and graphics processing unit (GPU) of the computer. In order to achieve as many as DMRG kept states within a limited GPU memory, we adopt the four-block formulation of the Hamiltonian rather than the two-block formulation. The later consumes much more memories, which has been used in another pioneer work on the hybrid parallelization of the DMRG algorithm, and only a small number of DMRG kept states are available. Our parallel strategy focuses on the diagonalization of the Hamiltonian, which is the most time-consuming part of the whole DMRG procedure. A hybrid parallelization strategy of diagonalization method is implemented, in which the required data for diagonalization are distributed on both the host and GPU memory, and the data exchange between them is negligible in our data partitioning scheme. The matrix operations are also shared on both CPU and GPU when the Hamiltonian acts on a wave function, while the distribution of these operations is determined by a load balancing strategy. Taking fermionic Hubbard model for example, we examine the running performance of the hybrid parallelization strategy with different DMRG kept states and provide corresponding performance benchmark. On a 4-leg ladder, we employ the conserved quantities with U(1) symmetry of the model and a good-quantum number based task scheduling to further reduce the GPU memory cost. We manage to obtain a moderate speedup of the hybrid parallelization for a wide range of DMRG kept states. In our example, the ground state energy with high accuracy is obtained by the extrapolation of the results, with different numbers of states kept, and we show charge stripes which are usually experimentally observed in high-temperature superconductors. In this case, we keep 104 DMRG states and the GPU memory cost is less than 12 Gigabytes.
Keywords:density matrix renormalization group  strongly correlated lattice model  hybrid parallelization
点击此处可从《物理学报》浏览原始摘要信息
点击此处可从《物理学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号