research-article

Parallel implementation of linear algebra problems on Dawning-1000

Author:

Xuebin ChiAuthors Info & Claims

Journal of Computer Science and Technology, Volume 13, Issue 2

Pages 141 - 146

https://doi.org/10.1007/BF02946602

Published: 22 March 2023 Publication History

Abstract

In this paper, some parallel algorithms are described for solving numerical linear algebra problems on Dwning-1000. They include matrix multiplication,LU factorization of a dense matrix, Cholesky factorization of a symmetric matrix, and eigendecomposition of symmetric matrix for real and complex data types. These programs are constructed based on fast BLAS library of Dawning-1000 under NX environment. Some comparison results under different parallel environments and implementing methods are also given for Cholesky factorization. The execution time, measured performance and speedup for each problem on Dawning-1000 are shown. For matrix multiplication andLU factorization, 1.86GFLOPS and 1.53GFLOPS are reached.

References

[1]

Dongarra J J and Walker D W Software libraries for linear algebra computations on high performance computers SIAM Review 1995 37 151-180

Crossref

Google Scholar

[2]

Dongarra J J, Duff L S, Sorenson D C, van der Vorst H A. Solving linear system on vector and shared memory computers.SIAM Society for Industrial and Applied Mathematics, 1991.

Google Scholar

[3]

Chi X B Parallel implementation of cholesky decomposition on a transputer network Chinese J. Num. Math. & Appl. 1993 15 73-80

Google Scholar

[4]

Li G Y, Coleman T F. A Parallel Triangular Solver for a Hypercube Multiprocessor. TR 86-787, Cornell University, 1986.

Google Scholar

[5]

Wilkinson J H. The Algebraic Eigenvalue Problem. Oxford University Press, 1965.

Google Scholar

[6]

Golub G, van Loan G. Matrix Computation. The Johns Hopkins University Press, 1983.

Google Scholar

[7]

Gu M, Eisenstat S C. A Divide-and-Conquer Algorithm for The Symmetric Tridiagonal Eigen-problem. YALEU/DCS/RR-932, Feb. 22, 1994.

Google Scholar

[8]

Dongarra J J and Sorensen D C A fully parallel algorithm for the symmetric eigenvalue problem SIAM J. Sci. Stat. Comput. 1987 8 s139-s154

Crossref

Google Scholar

[9]

Ipsen I C F and Jessup E R Solving the symmetric tridiagonal eigenvalue problem on hypercube SIAM J. Sci. Stat. Comput. 1990 11 203-229

Crossref

Google Scholar

[10]

Chi X B. Parallel solver of generalized eigenproblem on Dawning-1000 InProceedings of the 1997 conference on Advances in parallel and distributed computing, IEEE computer Society Press, 1997, pp. 144–148.

Google Scholar

Recommendations

A parallel implementation of the CMRH method for dense linear systems

This paper presents an implementation of the CMRH (Changing Minimal Residual method based on the Hessenberg process) iterative method suitable for parallel architectures. CMRH is an alternative to GMRES and QMR, the well-known Krylov methods for solving ...
Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems

The main purpose of this paper is to develop stable versions of some Krylov subspace methods for solving linear systems of equations $Ax = b$. As in the case of Paige and Saunders's SYMMLQ [SIAM J. Numer. Anal., 12 (1975), pp. 617–624], our algorithms ...
Solving unsymmetric sparse systems of linear equations with PARDISO
Special issue: Selected numerical algorithms

Supernode partitioning for unsymmetric matrices together with complete block diagonal supernode pivoting and asynchronous computation can achieve high gigaflop rates for parallel sparse LU factorization on shared memory parallel computers. The progress ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Computer Science and Technology

Journal of Computer Science and Technology Volume 13, Issue 2

Mar 1998

96 pages

ISSN:1000-9000

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 March 2023

Received: 24 April 1997

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Recommendations

A parallel implementation of the CMRH method for dense linear systems

Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems

Solving unsymmetric sparse systems of linear equations with PARDISO

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations