loading...
New Partitioning Schemes for Parallel Modified Gram-Schmidt Orthogonalization
Taipei, Taiwan December 18-December 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.6451021997 International Symposium on Paral ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Suely Oliveira, Texas A&M University
Takako Soma, Texas A&M University
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.
Index Terms:
Gram-Schmidt Algorithms, orthogonalization, MPI, data partitioning, matrix computations.
Citation:
Suely Oliveira, Takako Soma, "New Partitioning Schemes for Parallel Modified Gram-Schmidt Orthogonalization," ispan, pp.233, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.