Improved parallelization techniques for the density matrix renormalization group
arXiv:0909.5662 · doi:10.1016/j.cpc.2010.03.018
Abstract
A distributed-memory parallelization strategy for the density matrix renormalization group is proposed for cases where correlation functions are required. This new strategy has substantial improvements with respect to previous works. A scalability analysis shows an overall serial fraction of 9.4% and an efficiency of around 60% considering up to eight nodes. Sources of possible parallel slowdown are pointed out and solutions to circumvent these issues are brought forward in order to achieve a better performance.
8 pages, 4 figures; version published in Computer Physics Communications
References in corpus (1)
Cited by in corpus (6)
- Tensor product methods and entanglement optimization for ab initio quantum chemistry
- The density matrix renormalization group algorithm on kilo-processor architectures: implementation and trade-offs
- Nature of quantum spin liquids of the S=1/2 Heisenberg antiferromagnet on the triangular lattice: A parallel DMRG study
- Time Evolution with the DMRG Algorithm: A Generic Implementation for Strongly Correlated Electronic Systems
- Implementation of the SU(2) Hamiltonian Symmetry for the DMRG Algorithm
- Distributed-Memory DMRG via Sparse and Dense Parallel Tensor Contractions