Abstract
The modified Gram-Schmidt algorithm (MGS) is used in many fields of computational science as a basic part for problems which relate to Numerical Linear Algebra. In this paper we describe different parallel implementations (blocked and unblocked) of the MGS-algorithm and show how computation and calculation overlap can increase the performance up to 38 percent on the two different Clusters platforms which where used for performance evaluation.
Chapter PDF
References
Radons, G., Rünger, G., Schwind, M., Yang, H.: Parallel Algorithms for the Determination of Lyapunov Characteristics of Large Nonlinear Dynamical Systems. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds.) PARA 2004. LNCS, vol. 3732, pp. 1131–1140. Springer, Heidelberg (2006)
Björck, Å.: Numerics of Gram-Schmidt Orthogonalization. Linear Algebra Appl., 197–198 & 297–316 (1994)
Jalby, W., Philippe, B.: Stability Analysis and Improvment of the Block Gram-schmidt Algorithm. SIAM Journal on Scientific and Statistical Computing 12, 1058–1073 (1991)
Dongarra, J., Du Croz, J., Duff, I., Hammarling, S.: A set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Soft. 16(1), 1–17 (1990)
Zapata, E.L., Lamas, J.A., Rivera, F.F., Plata, O.G.: Modified Gram-Schmidt QR factorization on Hypercube SIMD Computers. Journal of Parallel and Distributed Computing 12, 60–69 (1991)
De Meyer, H., Niyokindi, C., Vanden Berghe, G.: The implementation of parallel gram-schmidt orthogonalisation algorithms on a ring of transputers. Computers and Mathematics with Applications 25, 65–72 (1993)
O’Leary, D.P., Whitman, P.: Parallel QR factorization by householder and modified Gram-Schmidt algorithms. Parallel Computing 16, 99–112 (1990)
Vanderstraeten, D.: A Generalized Gram-Schmidt Procedure for Parallel Applications, http://citeseer.ist.psu.edu/vanderstraeten97generalized.html
Vanderstraeten, D.: An accurate parallel block Gram-Schmidt algorithm without reorthogonalization. Numer. Linear Algebra Appl. 7(4), 219–236 (2000)
Hoffmann, W.: Iterative Algorithms for Gram-Schmidt Orthogonalization. Computing 41, 334–348 (1989)
Oliveira, S., Borges, L., Holzrichter, M., Soma, T.: Analysis of different partitioning schemes for parallel Gram-Schmidt algorithms. Parallel Algorithms and Applications 14(4), 293–320 (2000)
Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide, 3rd edn., Philadelphia, PA. Society for Industrial and Applied Mathematics (1999)
Dackland, K., Elmroth, E., Kågström, B.: A Ring-Oriented Approach for Block Matrix Factorizations on Shared and Distributed Memory Architectures. In: PPSC, pp. 330–338 (1993)
Goto, K., van de Geijn, R.: On reducing tlb misses in matrix multiplication. Technical Report TR-2002-55 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rünger, G., Schwind, M. (2005). Comparison of Different Parallel Modified Gram-Schmidt Algorithms. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_90
Download citation
DOI: https://doi.org/10.1007/11549468_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)