[go: up one dir, main page]

Skip to main content
Log in

Parallel algorithm design on some distributed systems

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

Abstract

Some testing results on DAWNING-1000, Paragon and workstation cluster are described in this paper. On the home-made parallel system DAWNING-1000 with 32 computational processors, the practical performance of 1.117 Gflops and 1.58 Gflops has been measured in solving a dense linear system and doing matrix multiplication, respectively. The scalability is also investigated. The importance of designing efficient parallel algorithms for evaluating parallel systems is emphasized.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Al Geist, Adam Beguelin, Jack Dongaraet al. PVM: Parallel Virtual Machine—A User’s Guide and Tutorial for Network Parallel Computing. The MIT Press, Cambridge, Massachusetts, 1994.

    Google Scholar 

  2. Sun Jiachang. A class of local green-like parallel preconditioner algorithms for elliptic discrete equations: I. basic methods.Mathematica Numerica Sinica, 1995, 17(2): 141–153.

    Google Scholar 

  3. Jack J Dongarra, Jain S Duff, Danny C Sorensen, Henk A Van der Vorst. Solving linear systems on vector and shared memory computers. SIAM, Philadelphia, 1991.

    Google Scholar 

  4. Achi Brandt. Multi-level adaptive solutions to boundary-value problems.Mathematics of Computation, 1977, 31(138): 333–390.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by National 863 High-Tech Programme.

Sun Jiachang, Professor of the Institute of Software, Chinese Academy of Sciences, graduated in 1964 from the Chinese University of Science & Technology. His major research area is high performance computing and parallel software.

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.

Cao Jianwen, Resarcher Assistant of Institute of Software, Chinese Academy of Sciences, graduated in 1991 from Peking University and got his M.S. degree in 1994 from Computing Center of Chinese Academy of Sciences. His major research area is parallel iteration computing on nonsymmetric linear system and eigenvalue problem.

Zhang Linbo, Professor of Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, graduated in 1982 from Peking University and got his Ph.D. degree in 1987 from University of Paris-sud. His major research area is computational fluid dynamics and parallel computing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, J., Chi, X., Cao, J. et al. Parallel algorithm design on some distributed systems. J. of Comput. Sci. & Technol. 12, 97–104 (1997). https://doi.org/10.1007/BF02951328

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation