Abstract
Conjugate-Gradients algorithms are recognized as competitive, among the available fast iterative schemes, for the solution of large-scale linear systems. The paper presents a parallel implementation, on distributed memory architectures using the SPMD programming paradigm, of the CGS and BiCGSTAB methods associated with the most popular algebraic preconditioners. We analyze the programming environment supplied by a Cray-T3D to handle data communication and data distribution and compare the performance of two versions of our code: one based on the PVM message passing interface and the other one based on the Shared Memory Access Library. The influence of a block-cyclic partitioning on the performance of the algorithms is also investigated, focusing the attention on the incomplete LU factorization preconditioner. In particular we address the tradeoff between minimizing interprocessor communication and exploiting the available parallelism by a suitable data distribution. The numerical experiments, carried out with different matrix sizes, show that the block-cyclic distribution gives satisfactory results if the problem is large enough.
Preview
Unable to display preview. Download preview PDF.
References
Sonnenveld, P.: CGS: A fast Lanczos-type solver for non-symmetric linear systems. SIAM J. Sci. Statist. Comput. 10 (1989) 36–52
Van der Vorst, H.A.: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems. SIAM J. Sci. Statist. Comput. 13 (1992) 631–644
Van der Vorst, H.A.: Parallel Iterative Solution Methods for Linear Systems arising from Discretized PDE's. AGARD-FDP-VKI Workshop Lecture Notes (1995)
Heath, M. T., Romine, C. H.: Parallel solution of triangular systems on distributed memory multiprocessors. SIAM J. Sci. Statist. Comput. 9 (1988) 558–588
Eisenstat, S. C., Heath, M. T., Henkel, C. S. and Romine, C. H.: Modified cyclic algorithms for solving triangular systems on distributed memory multiprocessors. SIAM J. Sci. Statist. Comput. 9 (1988) 558–588
PVM and HeNCE Programmer's Manual, ShMem user's Manual
Banerjee,P., Chandy,J. A., Hodges IV,E. W., Holm,J. G., Lain,A., Palermo,D. J., Ramaswamy,S. Su,E.: The Paradigm Compiler for Distributed-Memory Multicomputers. Computer October 1995 37–47
Dongarra, J., Du Croz, J., Hammarling, S., Hanson, R. J.: An extended set of FORTRAN Basic Linear Algebra Subprograms. ACM Transaction on Mathematical Software 14 (1988) 1–17
Guest,A., Beguelin,A., Dongarra,J., Jiang,W., Manchek,R., Sunderam,V.: PVM 3 User's Guide and Reference Manual. (1993)
Golub, G.H., O Leary, D.P.: Some history of the conjugate gradient and Lanczos algorithms: 1948–1976. SIAM Review 31 (1989) 50–102
Freeman,T.L., Phillips, C: Parallel Numerical Algorithms. Prentice Hall International (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fornasari, N., Rovida, S. (1996). Conjugate-gradients algorithms on a Cray-T3D. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_612
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_612
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive