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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have