O(a)-improved QCD+QED Wilson Dirac operator on GPUs

Markov Chain Monte Carlo simulations of lattice Quantum Chromodynamics (QCD) are the only known tool to investigate non-perturbatively the theory of the strong interaction and are required to perform precision tests of the Standard Model of Particle Physics. As the Markov Chain is a serial process, the sole option for improving the sampling rate is accelerating each individual update step. Heterogeneous clusters of GPU-accelerated nodes offer large total memory bandwidth which can be used to speed-up our application, openQxD-1.1, which is dominated by inversions of the Dirac operator, a large sparse matrix. In this work we investigate offloading the inversion to GPU using the lattice-QCD library QUDA, and our early results demonstrate a significant potential speed-up in the time-to-solution for state-of-the-art problem sizes. Minimal extensions to the existing QUDA library are required for our specific physics programme while greatly enhancing the performance portability of our code and retaining the reliability and robustness of existing applications in openQxD-1.1. Our new interface will enable us to utilize pre-exascale infrastructure and reduce the systematic uncertainty in our physics predictions by incorporating the effects of quantum electromagnetism (QED) in our simulations.

Authors

Publication Details

Published
2025-02-12
DOI
https://doi.org/10.22323/1.466.0280
Primary Topic
Particle physics theoretical and experimental studies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

O(a)-improved QCD+QED Wilson Dirac operator on GPUs

Jens Lücke, Hannes Vogt, Joshua Garza, Stefan Alexander Maier et al.
Particle physics theoretical and experimental studies
article

O(a)-improved QCD+QED Wilson Dirac operator on GPUs

Jens Lücke, Hannes Vogt, Joshua Garza, Stefan Alexander Maier, Paola Tavella, Isabel Campos, Anian Altherr, Javad Komijani, Agostino Patella, Jonathan Coles, Roman Gruber, Alessandro Cotellucci, Letizia Parato, T. H. Harris, Marina Marinković, Sara Rosso
article en

Abstract

Markov Chain Monte Carlo simulations of lattice Quantum Chromodynamics (QCD) are the only known tool to investigate non-perturbatively the theory of the strong interaction and are required to perform precision tests of the Standard Model of Particle Physics. As the Markov Chain is a serial process, the sole option for improving the sampling rate is accelerating each individual update step. Heterogeneous clusters of GPU-accelerated nodes offer large total memory bandwidth which can be used to speed-up our application, openQxD-1.1, which is dominated by inversions of the Dirac operator, a large sparse matrix. In this work we investigate offloading the inversion to GPU using the lattice-QCD library QUDA, and our early results demonstrate a significant potential speed-up in the time-to-solution for state-of-the-art problem sizes. Minimal extensions to the existing QUDA library are required for our specific physics programme while greatly enhancing the performance portability of our code and retaining the reliability and robustness of existing applications in openQxD-1.1. Our new interface will enable us to utilize pre-exascale infrastructure and reduce the systematic uncertainty in our physics predictions by incorporating the effects of quantum electromagnetism (QED) in our simulations.

Nvidia, Branco Weiss Fellowship – Society in Science, China Scholarship Council, Centro Svizzero di Calcolo Scientifico, National Supercomputing Centre Singapore
Affordable and clean energy
Openalex Percentile: Top 98%
Particle physics theoretical and experimental studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.