Related papers: Multi-mass solvers for lattice QCD on GPUs
An efficient error reconciliation scheme is important for post-processing of quantum key distribution (QKD). Recently, a multi-matrix low-density parity-check codes based reconciliation algorithm which can provide remarkable perspectives…
We present the results of a precision computation of B_K with Wilson fermions. Simulations are performed at different lattice spacings, enabling continuum limit extrapolations. Two different twisted mass QCD (tmQCD) regularisations are…
It is well-known that molecular dynamics integrators, which are used for lattice quantum chromodynamics (QCD), suffer from instabilities and possess a rather low order of the accuracy. Hence, it is highly desirable to construct a new class…
Recent developments have shown that a lot can be gained for QCD simulations from GPU hardware. This can be exploited especially in the case of Ginsparg-Wilson fermions when the com putational costs are particularly high. In this work, we…
One flavor mass reweighting can be used in lattice QCD computations to fine tune the quark masses to their physical values. We present a new method that utilizes an unbiased stochastic estimation of the one flavor determinant. The…
We describe initial work on an extension of the Kaldi toolkit that supports weighted finite-state transducer (WFST) decoding on Graphics Processing Units (GPUs). We implement token recombination as an atomic GPU operation in order to fully…
Current PC processors are equipped with vector processing units and have other advanced features that can be used to accelerate lattice QCD programs. Clusters of PCs with a high-bandwidth network thus become powerful and cost-effective…
We discuss the implementation and optimization challenges for a Wilson-Dirac solver with Clover term on QPACE, a parallel machine based on Cell processors and a torus network. We choose the mixed-precision Schwarz preconditioned FGCR…
We present the results of an effort to accelerate a Rational Hybrid Monte Carlo (RHMC) program for lattice quantum chromodynamics (QCD) simulation for 2 flavours of staggered fermions on multiple Kepler K20X GPUs distributed on different…
We report on the first successful QCD multigrid algorithm which demonstrates constant convergence rates independent of quark mass and lattice volume for the Wilson Dirac operator. The new ingredient is the adaptive method for constructing…
A high-performance implementation of a multiphase lattice Boltzmann method based on the conservative Allen-Cahn model supporting high-density ratios and high Reynolds numbers is presented. Metaprogramming techniques are used to generate…
We present an overview of our project of simulation of unquenched lattice QCD with optimal domain-wall quarks, using a GPU cluster currently constituting of 16 units of Nvidia Tesla S1070 plus 64 graphic cards with Nvidia GTX285 (total 128…
Quenched lattice QCD calculations with Wilson-type fermions at small quark masses are impeded by exceptional configurations. We show how this problem can be resolved in a practicable way without changing the physics in the chiral limit.
We propose to express the forward-backward algorithm in terms of operations between sparse matrices in a specific semiring. This new perspective naturally leads to a GPU-friendly algorithm which is easy to implement in Julia or any…
We describe our implementation of a multigrid solver for Wilson-clover fermions, which increases parallelism by solving for multiple right-hand sides (MRHS) simultaneously. The solver is based on Grid and thus runs on all computing…
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
Classical multivariate statistical methods such as covariance estimation and principal component analysis are well understood mathematically, yet their application at extreme data scales remains challenging. When the number of observations…
Handling clustering problems are important in data statistics, pattern recognition and image processing. The mean-shift algorithm, a common unsupervised algorithms, is widely used to solve clustering problems. However, the mean-shift…
Hamiltonian lattice QCD with Wilson fermions is investigated systematically by strong-coupling expansion up to the second order. The effective Hamiltonian is diagonalized by Bogoliubov transformation. The vacuum energy, chiral condensate,…
QCD is investigated at finite temperature using Wilson fermions in the fixed scale approach. A 2+1 flavor stout and clover improved action is used at four lattice spacings allowing for control over discretization errors. The light quark…