tmLQCD: A program suite to simulate Wilson twisted mass lattice QCD
We discuss a program suite for simulating Quantum Chromodynamics on a 4-dimensional space-time lattice. The basic Hybrid Monte Carlo algorithm is introduced and a number of algorithmic improvements are explained. We then discuss the implementations of these concepts as well as our parallelisation strategy in the actual simulation code. Finally, we provide a user guide to compile and run the program. Program summary Program title: tmLQCD Catalogue identifier: AEEH_v1 -0 Program summary URL:: http://cpc.cs.qub.ac.uk/sumiiiaries/AEEH-v1-0.html Program obtainablefrom: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public Licence (GPL) No. of lines in distributed program. including test data, etc.: 122768 No. ofbytes in distributed program, including test data, etc.: 931042 Distribution format: tar.gz Programming language: C and MPI Computer: any Operating system: any with a standard C compiler Has the code been vectorised orparallelised?: Yes. One or optionally any even number ofprocessors may be used. Tested with up to 32768 processors RAM: no typical values available Classification: 11.5 External routines: LAPACK [1] and LIME [2] library Nature ofproblem: Quantum Chromodynamics Solution method: Markov Chain Monte Carlo using the Hybrid Monte Carlo algorithm with mass preconditioning and multiple time scales [3]. Iterative solver for large systems of linear equations. Restrictions: Restricted to an even number of (not necessarily mass degenerate) quark flaVOUrs in the Wilson or Wilson twisted mass formulation of lattice QCD. Running time: Depending on the problem size, the architecture and the input parameters from a few minutes to weeks. References: [1] http://www.iietlib.org/lapack/. [12] USQCD, http://tisqcd.jlab.org/usqcd-docs/c-lime/. [3] C. Urbach, K. Jansen, A. Shindler, U. Wenger, Comput. Phys. Commun. 174 (2006) 87, hep-lat/050601 1. (C) 2009 Elsevier B.V. All rights reserved.
lattice qcd hybrid monte carlo algorithm