The Community for Technology Leaders
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1997)
Aizu-Wakamatsu, Fukushima, JAPAN
Mar. 17, 1997 to Mar. 21, 1997
ISBN: 0-8186-7870-4
pp: 175
Marián Vajtersic , Slovak Academy of Sciences
Martin Becka , Slovak Academy of Sciences
ABSTRACT
The paper ? presents parallel algorithms for eflcient solution of the SVD (Singular Value Decomposition) problem by the block two-sided Jacobi method. It is shown how the method could be applied to MIMD computers with the hypercube and ring topology. Three types of orderings for solving SVD on block-structured submatrices are analysed from the point of view of communication requirements and suitability for a parallel execution of the computationalprocess. which is carried out on block-columns of the matrix. All three orderings fit well to the hypercube topology. Two of them can be directly implemented also on rings. The optimality in parallelization of the method and data transfers has been achieved there within each sweep. For the third scheme, an eficient numbering of processor nodes is discussed. Computer results obtained on an Intel Paragon system are shown for a chosen ordering.
INDEX TERMS
CITATION
Marián Vajtersic, Martin Becka, "Block-SVD Algorithms and Their Adaptation to Hypercubes and Rings", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 175, 1997, doi:10.1109/AISPAS.1997.581655
87 ms
(Ver 3.3 (11022016))