Skip to main content
SpringerLink
Log in

Parallel implementation of linear algebra problems on Dawning-1000

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dongarra J J, Walker D W., Software libraries for linear algebra computations on high performance computers.SIAM Review, 1995, 37: 151–180.

    Article  MathSciNet  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.

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

    MathSciNet  Google Scholar 

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

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

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

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

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  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.

Download references

Author information

Authors and Affiliations

  1. Institute of Software, Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Chi Xuebin

Authors
  1. Chi Xuebin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chi Xuebin.

Additional information

This work was supported by National Climbing Program B and National ‘863’ High-Tech Program of China.

Chi Xuebin, Associate Professor of Institute of Software, Chinese Academy of Sciences, graduated in 1983 from Jilin University of Technology and got his Ph.D. degree in 1989 from Computing Center of Chinese Academy of Sciences. His major research area is parallel computing on linear algebra problem and nonlinear equations.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chi, X. Parallel implementation of linear algebra problems on Dawning-1000. J. of Comput. Sci. & Technol. 13, 141–146 (1998). https://doi.org/10.1007/BF02946602

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946602

keywords

Search

Navigation