16870

Accelerating Lattice QCD Multigrid on GPUs Using Fine-Grained Parallelization

M. A. Clark, Balint Joo, Alexei Strelchenko, Michael Cheng, Arjun Gambhir, Richard Brower
NVIDIA Corporation, 2701 San Tomas Expressway, Santa Clara, CA 91214, USA
arXiv:1612.07873 [hep-lat], (23 Dec 2016)

@article{clark2016accelerating,

   title={Accelerating Lattice QCD Multigrid on GPUs Using Fine-Grained Parallelization},

   author={Clark, M. A. and Joo, Balint and Strelchenko, Alexei and Cheng, Michael and Gambhir, Arjun and Brower, Richard},

   year={2016},

   month={dec},

   archivePrefix={"arXiv"},

   primaryClass={hep-lat}

}

Download Download (PDF)   View View   Source Source   

329

views

The past decade has witnessed a dramatic acceleration of lattice quantum chromodynamics calculations in nuclear and particle physics. This has been due to both significant progress in accelerating the iterative linear solvers using multi-grid algorithms, and due to the throughput improvements brought by GPUs. Deploying hierarchical algorithms optimally on GPUs is non-trivial owing to the lack of parallelism on the coarse grids, and as such, these advances have not proved multiplicative. Using the QUDA library, we demonstrate that by exposing all sources of parallelism that the underlying stencil problem possesses, and through appropriate mapping of this parallelism to the GPU architecture, we can achieve high efficiency even for the coarsest of grids. Results are presented for the Wilson-Clover discretization, where we demonstrate up to 10x speedup over present state-of-the-art GPU-accelerated methods on Titan. Finally, we look to the future, and consider the software implications of our findings.
VN:F [1.9.22_1171]
Rating: 3.8/5 (5 votes cast)
Accelerating Lattice QCD Multigrid on GPUs Using Fine-Grained Parallelization, 3.8 out of 5 based on 5 ratings

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: