We describe the steps which lead to a speed efficiency of about 48% for a code for the simulation of pure SU(2) Lattice Gauge Theory on the Intel Paragon XP/S Supercomputer. Here the efficiency is defined by the ratio of sustained MFLOPS performance over the peak performance. The maximal size of the lattice is 80 × 483, and up to 135 compute nodes have been used. We analyze several kernels, written partly in assembler language, and we describe the communication strategy both for the updating process and for the measurement. Exclusive use of FORTRAN language leads to a performance reduction of a factor 2.4 as compared to the assembler case
This paper briefly describes the physics motivations and strategies of Lattice Gauge Theory (LGT), t...
We discuss how the steepest descent method with Fourier acceleration for Laudau gauge fixing in latt...
Special-purpose computers are appropriate tools for the study of lattice gauge theory. While these m...
We describe the steps which lead to a speed efficiency of about 48% for a code for the simulation of...
The standardized-maximalist approach to supercom-puter benchmarking consists in optimizing a standar...
In this work we explore the performance of CUDA in quenched lattice SU(2) simulations. CUDA, NVIDIA ...
We consider the implementation of a parallel Monte Carlo code for high-performance simulations on PC...
We discuss the CUDA approach to the simulation of pure gauge Lattice SU(2). CUDA is a hardware and s...
AbstractWe report our implementation experience of a lattice gauge theory code on the Cell Broadband...
This paper reviews the unusual computational requirements associated to numerical simulations of La...
We review the architecture of massively parallel machines used for lattice QCD simulations and prese...
Lattice Gauge Theory is an integral part of particle physics that requires high performance computin...
The MIMD Lattice Computation (MILC) code (version 7.4.0) is a set of codes developed by the MIMD Lat...
Lattice QCD is a fundamental non-perturbative approach to solving the quantum chromodynamics (QCD) t...
The starting point of any lattice QCD computation is the generation of a Markov chain of gauge field...
This paper briefly describes the physics motivations and strategies of Lattice Gauge Theory (LGT), t...
We discuss how the steepest descent method with Fourier acceleration for Laudau gauge fixing in latt...
Special-purpose computers are appropriate tools for the study of lattice gauge theory. While these m...
We describe the steps which lead to a speed efficiency of about 48% for a code for the simulation of...
The standardized-maximalist approach to supercom-puter benchmarking consists in optimizing a standar...
In this work we explore the performance of CUDA in quenched lattice SU(2) simulations. CUDA, NVIDIA ...
We consider the implementation of a parallel Monte Carlo code for high-performance simulations on PC...
We discuss the CUDA approach to the simulation of pure gauge Lattice SU(2). CUDA is a hardware and s...
AbstractWe report our implementation experience of a lattice gauge theory code on the Cell Broadband...
This paper reviews the unusual computational requirements associated to numerical simulations of La...
We review the architecture of massively parallel machines used for lattice QCD simulations and prese...
Lattice Gauge Theory is an integral part of particle physics that requires high performance computin...
The MIMD Lattice Computation (MILC) code (version 7.4.0) is a set of codes developed by the MIMD Lat...
Lattice QCD is a fundamental non-perturbative approach to solving the quantum chromodynamics (QCD) t...
The starting point of any lattice QCD computation is the generation of a Markov chain of gauge field...
This paper briefly describes the physics motivations and strategies of Lattice Gauge Theory (LGT), t...
We discuss how the steepest descent method with Fourier acceleration for Laudau gauge fixing in latt...
Special-purpose computers are appropriate tools for the study of lattice gauge theory. While these m...