Multi-mass solvers for lattice QCD on GPUs

Graphical Processing Units (GPUs) are more and more frequently used for lattice QCD calculations. Lattice studies often require computing the quark propagators for several masses. These systems can be solved using multi-shift solvers but these algorithms are memory intensive which limits the size of...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational physics Vol. 231; no. 4; pp. 1866 - 1878
Main Authors Alexandru, A., Pelissier, C., Gamari, B., Lee, F.X.
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Inc 20.02.2012
Elsevier
Subjects
Algorithms
BiCGstab
BiCGstab-M
Computation
Computational techniques
Exact sciences and technology
Fermions
GPU
Lattices
Mathematical analysis
Mathematical methods in physics
Physics
Quarks
Solvers
GPU
BiCGstab
BiCGstab-M
Wilson theory
Algorithms
Lattice theory
Propagator
Quarks
Calculation
Calculation methods
Online AccessGet full text

Cover

More Information
Summary:Graphical Processing Units (GPUs) are more and more frequently used for lattice QCD calculations. Lattice studies often require computing the quark propagators for several masses. These systems can be solved using multi-shift solvers but these algorithms are memory intensive which limits the size of the problem that can be solved using GPUs. In this paper, we show how to efficiently use a memory-lean single-mass solver to solve multi-mass problems. We focus on the BiCGstab algorithm for Wilson fermions and show that the single-mass solver not only requires less memory but also outperforms the multi-shift variant by a factor of two.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0021-9991
1090-2716
DOI:10.1016/j.jcp.2011.11.003