Abstract
This paper presents some novel algorithms to implement the Jacobi method in hypercube multicomputers. The algorithms are based on the one-sided Jacobi method and use new Jacobi orderings, which are one of the contributions of this paper. The second contribution of this paper is the use of a systematic algorithm transformation, which is referred to as communication pipelining, and is aimed at reducing the communication overhead by exploiting parallelism in the communication operations. The proposed schemes are evaluated by means of analytical models and compared with previous proposals. The results show a significant reduction in the communication overhead, which in some cases can be by a factor almost as great as the number of dimensions of the hypercube.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. C. Athas and C. L. Seitz. Multicomputers: message-passing concurrent computers. IEEE Computer, 9–24, August 1988.
C. Bischof. The two-sided Jacobi method on a hypercube. In SIAM Proceedings of the Second Conference on Hypercube Multiprocessors, 1987.
L. Díaz de Cerio, A. González and M. Valero-García. Communication pipelining in hypercubes. Parallel Processing Letters, 6(4): December 1996.
P. J. Eberlein. On one-sided Jacobi methods for parallel computation. SIAM J. Algebraic Discrete Methods, 8:790–796, 1987.
P. J. Eberlein and H. Park. Efficient implementation of Jacobi algorithms and Jacobi sets on distributed memory architectures. Journal of Parallel Distributed Computing. 8:358–366, 1990.
G. Fox et al. Solving Problems on Concurrent Processors. Prentice-Hall, Englewood Cliffs, NJ, 1988.
G. R. Gao and S. J. Thomas. An optimal parallel Jacobi-like solution method for singular value decomposition. In Proceedings of Int'l Conf. on Parallel Processing, pp. 47–53, 1988.
J. Gotze, S. Paul, and M. Sauer. An efficient Jacobi-like algorithm for parallel eigenvalue computation. IEEE Trans. Comput. C-42, 9:1058–1063, 1993.
M. Mantharam and P. J. Eberlein. Block-recursive algorithm to generate Jacobi-sets. Parallel Computing, 19:481–496, 1993.
L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in directed networks. IEEE Computer, 26(2):62–76, 1993.
D. S. Watkins. Understanding the QR algorithm. SIAM Review, 24(4):427–440, 1982.
J. H. Wilkinson. The Algebraic Eigenvalue Problem. Clarendon Press, Oxford, 1965.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Royo, D., González, A. & Valero-García, M. Low Communication Overhead Jacobi Algorithms for Eigenvalues Computation on Hypercubes. The Journal of Supercomputing 14, 171–193 (1999). https://doi.org/10.1023/A:1008162909318
Issue Date:
DOI: https://doi.org/10.1023/A:1008162909318