Jacobi Orderings for Multi-Port Hypercubes

Authors:
Affiliations:
Venue:
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Year:
1998

Citing 7
Cited 0

Solving problems on concurrent processors

Solving problems on concurrent processors
Multicomputers: Message-Passing Concurrent Computers

Computer
Software pipelining: an effective scheduling technique for VLIW machines

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
On one-sided Jacobi methods for parallel computation

SIAM Journal on Algebraic and Discrete Methods
Efficient implementation of Jacobi algorithms and Jacobi sets on distributed memory architectures

Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
An Efficient Jacobi-Like Algorithm for Parallel Eigenvalue Computation

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The communication cost plays a key role in the performance of many parallel algorithms. In the particular case of the one-sided Jacobi method for symmetric eigenvalue and eigenvector computation the communication cost of previously proposed algorithms is mainly determined by the particular ordering being used. In this paper we proposed two novel Jacobi orderings: the permuted-BR ordering and the degree-4 ordering, aimed at efficiently exploiting the multi-port capability of a hypercube. It is shown that the former is nearly optimal for some scenarios and the latter outperforms previously known orderings by a factor of two.