DocumentCode :
3260058
Title :
New partitioning schemes for parallel modified Gram-Schmidt orthogonalization
Author :
Oliveria, S. ; Soma, Takako
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
fYear :
1997
fDate :
18-20 Dec 1997
Firstpage :
233
Lastpage :
239
Abstract :
In this paper we are concerned with parallel implementation of row-oriented Gram-Schmidt orthogonalization. For the data partitioning four types of columnwise partitioning schemes were considered: column (1-col), block, cyclic and block-cyclic (b-c) partitioning. Analytical models for parallel execution time required by these implementations are derived and compared with numerical results. The best partitioning scheme is shown theoretically and by numerical results
Keywords :
computational complexity; matrix algebra; parallel algorithms; Gram-Schmidt orthogonalization; columnwise partitioning; data partitioning; execution time; parallel implementation; partitioning scheme; Analytical models; Computer science; IEEE members; Linear algebra; Parallel algorithms; Partitioning algorithms; Scientific computing; Stability; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on
Conference_Location :
Taipei
ISSN :
1087-4089
Print_ISBN :
0-8186-8259-6
Type :
conf
DOI :
10.1109/ISPAN.1997.645102
Filename :
645102
Link To Document :
بازگشت