Title
Low Communication Overhead Jacobi Algorithms for Eigenvalues Computation on Hypercubes
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.
Year
DOI
Venue
1999
10.1023/A:1008162909318
The Journal of Supercomputing
Keywords
DocType
Volume
eigenproblem,Jacobi ordering,CC-cube algorithms,communication pipelining,one port architecture,multiple port architecture,hamiltonian path
Journal
14
Issue
ISSN
Citations 
2
1573-0484
2
PageRank 
References 
Authors
0.38
5
3
Name
Order
Citations
PageRank
Dolors Royo Valles1607.20
Antonio González23178229.66
Miguel Valero-García3599.01