Abstract
In this paper, we study the parallelization of the Jacobi method to solve the symmetric eigenvalue problem on distributed-memory multiprocessors. To obtain a theoretical efficiency of 100% when solving this problem, it is necessary to exploit the symmetry of the matrix. The only previous algorithm we know exploiting the symmetry on multicomputers is that in [10], but that algorithm uses a storage scheme appropriate for a logical ring of processors, thus having a low scalability. In this paper we show how matrix symmetry can be exploited on a logical mesh of processors obtaining a higher scalability than that obtained with the algorithm in [10]. Algorithms for ring and mesh logical topologies are compared experimentally on the PARSYS SN-1040 and iPSC/860 multicomputers.
Partially supported by ESPRIT III Basic Research Programm of the EC under contract No.9072 (Project GEPPCOM) and partially supported by Generalitat Valenciana Project GV-1076/93.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. P. Brent and F. T. Luk. A systolic architecture for almost linear-time solution of the symmetric eigenvalue problem. Technical Report TR-CS-82-10, Department of Computer Science, Australian National University, Camberra, August 1982.
P. J. Eberlein and H. Park. Efficient implementation of Jacobi algorithms and Jacobi sets on distributed memory architectures. Journal of Parallel and Distributed Computing, 8:358–366, 1990.
A. Edelman. Large dense linear algebra in 1993: The parallel computing influence. The International Journal of Supercomputer Applications, 7(2):113–128, 1993.
D. Giménez, V. Hernández, R. van de Geijn and A. M. Vidal. A jacobi method by blocks to solve the symmetric eigenvalue problem on a mesh of processors. ILAS Conference, 1994.
G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, 1989.
I. N. Levine. Molecular Spectroscopy. John Wiley and Sons, 1975.
M. Pourzandi and B. Tourancheau. A Parallel Performance Study of Jacobi-like Eigenvalue Solution. Technical report, March 1994.
G. H. Stewart. A Jacobi-like algorithm for computing the Schur decomposition of a nonhermitian matrix. SIAM J. Sci. Stat. Comput., 4:853–864, 1985.
V. Strumpen and P. Arbenz. Improving Scalability by Communication Latency Hiding. In D. H. Bailey, P. E. Bjørstad, J. R. Gilbert, M. V. Mascagni, R. S. Schreiber, H. D. Simon, V. J. Torczon and L. T. Watson, editor, Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, pages 778–779. SIAM, 1995.
R. A. van de Geijn. Storage schemes for Parallel Eigenvalue Algorithms. In G. H. Golub and P. Van Dooren, editor, Numerical Linear Algebra. Digital Signal Processing and Parallel Algorithms, volume 70 of NATO ASI Series. Springer-Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giménez, D., Hernández, V., Vidal, A.M. (1996). Efficient Jacobi algorithms on multicomputers. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science. PARA 1995. Lecture Notes in Computer Science, vol 1041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60902-4_28
Download citation
DOI: https://doi.org/10.1007/3-540-60902-4_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60902-5
Online ISBN: 978-3-540-49670-0
eBook Packages: Springer Book Archive