Highly optimized code for lattice quantum chromodynamics on the CRAY T3E
Highly optimized code for lattice quantum chromodynamics on the CRAY T3E
In lattice quantum chromodynamics, large systems of linear equations have to be solved to compute physical quantities. The availability of efficient parallel Krylov subspace solvers plays a vital role in the solution of these systems. We present a detailed analysis of the performance of the stabilis...
Saved in:
Personal Name(s): | Attig, N. (Corresponding Author) |
---|---|
Güsken, S. / Lacock, P. / Lippert, Thomas / Schilling, K. / Ueberholz, P. / Viehoff, J. | |
Contributing Institute: |
Zentralinstitut für Angewandte Mathematik; ZAM Jülich Supercomputing Center; JSC |
Published in: |
Parallel Computing: Fundamentals, Applications and New Directions |
Imprint: |
Elsevier
1998
|
Physical Description: |
557 - 564 |
DOI: |
10.1016/S0927-5452(98)80071-3 |
Conference: | International Conference on Parallel Computing, Bonn (Germany), 1997-09-16 - 1997-09-19 |
Document Type: |
Contribution to a book Contribution to a conference proceedings |
Research Program: |
ohne Topic |
Series Title: |
Advances in Parallel Computing
12 |
Link: |
OpenAccess OpenAccess |
Publikationsportal JuSER |
Please use the identifier: http://hdl.handle.net/2128/11928 in citations.
In lattice quantum chromodynamics, large systems of linear equations have to be solved to compute physical quantities. The availability of efficient parallel Krylov subspace solvers plays a vital role in the solution of these systems. We present a detailed analysis of the performance of the stabilised biconjugate gradient (BiCGStab) algorithm with symmetric successive over-relaxed (SSOR) preconditioning on a massively parallel CRAY T3E system. |