Abstract
In this paper we describe the parallelization of the SPAI preconditioner using a master-slave configuration in PVM. We propose three approaches to perform the communications in this algorithm, a centralized approach using the master process, a distributed approach based in a pooling mechanism, and a distributed approach based in a signaling mechanism.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Grote, M. and Simon, H.: Effective Parallel Preconditioning with Sparse Approximate Inverses. Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing, (1995), pp. 466–471.
Grote, M. and Simon, H.: A new approach to parallel preconditioning with Sparse Approximate Inverses. Tech. report SCCM-94-03, Department of Sci. Comput. and Comput. Math., Stanford University (1994).
Saad, Y.: ILUT: a dual Threshold Incomplete LU factorization. Numerical Linear Algebra with applications, Vol. 1, No. 4 (1994), pp. 387–402.
Saad, Y., Sultz, M. H.: GMRES: A generalized Minimal Residual Algorithm for Solving Non symmetric Linear Systems. SIAM J. Sci. Stat. Comput., Vol 7, No. 3 (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cela, J.M., Alfonso, J.M. (1996). Parallelization of the SPAI preconditioner in a master-slave configuration. In: Bode, A., Dongarra, J., Ludwig, T., Sunderam, V. (eds) Parallel Virtual Machine — EuroPVM '96. EuroPVM 1996. Lecture Notes in Computer Science, vol 1156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540617795_19
Download citation
DOI: https://doi.org/10.1007/3540617795_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61779-2
Online ISBN: 978-3-540-70741-7
eBook Packages: Springer Book Archive