Performance evaluation of parallel gram-schmidt re-orthogonalization methods

Authors:
Takahiro Katagiri
Affiliations:
PRESTO, Japan Sci. and Techn. Corp., JST Katagiri Lab., Comp. Cent. Div., Inf. Techn. Center, The Univ. of Tokyo, Bunkyo-ku, Tokyo, Tokyo, Japan and Dept. of Inf. Network Sci., Grad. Sch. of Inf. ...
Venue:
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Year:
2002

Citing 6
Cited 0

The WY representation for products of householder matrices

SIAM Journal on Scientific and Statistical Computing - Papers from the Second Conference on Parallel Processing for Scientific Computin
The torus-wrap mapping for dense matrix calculations on massively parallel computers

SIAM Journal on Scientific Computing
Applied numerical linear algebra

Applied numerical linear algebra
The symmetric eigenvalue problem

The symmetric eigenvalue problem
Matrix algorithms

Matrix algorithms
Numerical Linear Algebra for High Performance Computers

Numerical Linear Algebra for High Performance Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the performance of the five kinds of parallel reorthogonalization methods by using the Gram-Schmidt (G-S) method is reported. Parallelization of the re-orthogonalization process depends on the implementation of G-S orthogonalization process, i.e. Classical GS (CG-S) and Modified G-S (MG-S). To relax the parallelization problem, we propose a new hybrid method by using both the CG-S and MG-S. The HITACHI SR8000/MPP of 128 PEs, which is a distributed memory super-computer, is used in this performance evaluation.