Related papers: A Parallel SSOR Preconditioner for Lattice QCD
Optimization of applications for supercomputers of the highest performance class requires parallelization at multiple levels using different techniques. In this contribution we focus on parallelization of particle physics simulations…
Sparse linear system solvers are computationally expensive kernels that lie at the heart of numerous applications. This paper proposes a flexible preconditioning framework to substantially reduce the time and energy requirements of this…
We discuss the application of hybrid over-relaxation, even-odd preconditioning and a modified local updating procedure to the local bosonic fermion algorithm. Studies on autocorrelation times and the tuning of the parameters of the…
I review recent machine trends and algorithmic developments for dynamical lattice QCD simulations with the HMC algorithm for Wilson-type fermions. The topics include the trend toward multi-core processors and general purpose GPU (GPGPU)…
We apply a recent proposal to speed up the Hybrid-Monte-Carlo simulation of systems with dynamical fermions to two flavor QCD with clover-improvement. For our smallest quark masses we see a speed-up of more than a factor of two compared…
We present a modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD. A larger number of test vectors than that used in conventional multigrid is generated by the smoother. This set of test…
In order to develop fast inversion algorithms we have used overlap solvers in two dimensions. Lattice QED theory with U(1) group symmetry in two dimensional space-times dimensions has always been a testing ground for algorithms. By the…
Cost estimates for simulations of full QCD with n_f=2 Wilson fermions by hybrid Monte Carlo are presented. The extrapolations are based on the average number of iterations of the iterative solver within the fermionic part of the HMC…
The improvement of simulations of QCD with dynamical Wilson fermions by combining the Hybrid Monte Carlo algorithm with parallel tempering is studied on $10^4$ and $12^4$ lattices. As an indicator for decorrelation the topological charge is…
Over the past five years, graphics processing units (GPUs) have had a transformational effect on numerical lattice quantum chromodynamics (LQCD) calculations in nuclear and particle physics. While GPUs have been applied with great success…
It is well known that the block Krylov subspace solvers work efficiently for some cases of the solution of differential equations with multiple right-hand sides. In lattice QCD calculation of physical quantities on a given configuration…
Lattice simulations of Quantum Chromodynamics (QCD) enable one to calculate the low-energy properties of the strong interaction among quarks and gluons based on the first principle. The most time-consuming part of the numerical simulations…
Parallel computing has played an important role in speeding up convex optimization methods for big data analytics and large-scale machine learning (ML). However, the scalability of these optimization methods is inhibited by the cost of…
Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the…
We demonstrate that substantial progress can be achieved in the study of the phase structure of 4-dimensional compact QED by a joint use of hybrid Monte Carlo and multicanonical algorithms, through an efficient parallel implementation. This…
The dominant cost of most lattice QCD simulations is the inversion of the Dirac operator required to calculate the force term in the RHMC update. One way to improve this situation is to use multiple pseudofermions, which reduces the size…
We explore the possibility of computing fermionic correlators on the lattice by combining a domain decomposition with a multi-level integration scheme. The quark propagator is expanded in series of terms with a well defined hierarchical…
Close to the chiral limit, many calculations in numerical lattice QCD can potentially be accelerated using low-mode deflation techniques. In this paper it is shown that the recently introduced domain-decomposed deflation subspaces can be…
Simulating lattice QCD with chiral fermions and indeed using Domain Wall Fermions continues to be challenging project however large are concurrent computers. One obvious bottleneck is the slow pace of prototyping using the low level coding…
The discretization of the double-layer potential integral equation for the interior Dirichlet Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations…