Related papers: GPU implementation of a Landau gauge fixing algori…
In this work, we consider the GPU implementation of the steepest descent method with Fourier acceleration for Laudau gauge fixing, using CUDA. The performance of the code in a Tesla C2070 GPU is compared with a parallel CPU implementation.
In this paper we present and explore the performance of Landau gauge fixing in GPUs using CUDA. We consider the steepest descent algorithm with Fourier acceleration, and compare the GPU performance with a parallel CPU implementation. Using…
We explore the performance of CUDA in performing Landau gauge fixing in Lattice QCD, using the steepest descent method with Fourier acceleration. The code performance was tested in a Tesla C2070, Fermi architecture. We also present a study…
In this work, we present the GPU implementation of the overrelaxation and steepest descent method with Fourier acceleration methods for Laudau and Coulomb gauge fixing using CUDA for SU(N) with N>2. A multi-GPU implementation of the…
A lattice gauge theory framework for simulations on graphic processing units (GPUs) using NVIDIA's CUDA is presented. The code comprises template classes that take care of an optimal data pattern to ensure coalesced reading from device…
We adopt CUDA-capable Graphic Processing Units (GPUs) for Coulomb, Landau and maximally Abelian gauge fixing in 3+1 dimensional SU(3) lattice gauge field theories. The local overrelaxation algorithm is perfectly suited for highly parallel…
We adopt CUDA-capable Graphic Processing Units (GPUs) for Landau, Coulomb and maximally Abelian gauge fixing in 3+1 dimensional SU(3) and SU(2) lattice gauge field theories. A combination of simulated annealing and overrelaxation is used to…
An algorithm for gauge fixing to the minimal Landau gauge in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing.…
Here we present the cuLGT code for gauge fixing in lattice gauge field theories with graphic processing units (GPUs). Implementations for SU(3) Coulomb, Landau and maximally Abelian gauge fixing are available and the overrelaxation,…
We present a new implementation of the Fourier acceleration method for Landau gauge fixing. By means of a multigrid inversion we are able to avoid the use of the fast Fourier transform. This makes the method more flexible, and well suited…
In this work we explore the performance of CUDA in quenched lattice SU(2) simulations. CUDA, NVIDIA Compute Unified Device Architecture, is a hardware and software architecture developed by NVIDIA for computing on the GPU. We present an…
A class of algorithms for the Landau gauge fixing is proposed, which makes the steepest ascent (SA) method be more efficient by concepts of genetic algorithm. Main concern is how to incorporate random gauge transformation (RGT) %, mutation…
We provide details of the first implementation of a non-linear conjugate gradient method for Landau and Coulomb gauge fixing with Fourier acceleration. We find clear improvement over the Fourier accelerated steepest descent method, with the…
We provide details expanding on our implementation of a non-linear conjugate gradient method with Fourier acceleration for lattice Landau and Coulomb gauge fixing. We find clear improvement over the Fourier accelerated steepest descent…
Current algorithms used to put a lattice gauge configuration into Landau gauge either suffer from the problem of critical slowing-down or involve an additional computational expense to overcome it. Evolutionary Algorithms (EAs), which have…
We discuss the CUDA approach to the simulation of pure gauge Lattice SU(2). CUDA is a hardware and software architecture developed by NVIDIA for computing on the GPU. We present an analysis and performance comparison between the GPU and CPU…
We address the problem of the gauge fixing versus Gribov copies in lattice gauge theories. For the Landau gauge, results show that a suitable combination of evolutionary algorithms with traditional steepest descent methods identifies the…
We study the problem of critical slowing-down for gauge-fixing algorithms (Landau gauge) in $SU(2)$ lattice gauge theory on $2$ and $4$ dimensional lattices, both numerically and analytically. We consider five such algorithms, and we…
We describe the GPU implementation of shifted or multimass iterative solvers for sparse linear systems of the sort encountered in lattice gauge theory. We provide a generic tool that can be used by those without GPU programming experience…
We study the problem of critical slowing-down for gauge-fixing algorithms (Landau gauge) in $SU(2)$ lattice gauge theory on a $2$-dimensional lattice. We consider five such algorithms, and lattice sizes ranging from $8^{2}$ to $36^{2}$ (up…