Skip to main content

Parallel Computing for Linear Systems of Equations on Workstation Clusters

  • Conference paper
Current Trends in High Performance Computing and Its Applications
  • 1126 Accesses

Abstract

In this paper the parallel algorithm of preconditioned conjugate gradient method (PCGM) is presented and implemented on DELL workstation cluster. Optimization techniques for the sparse matrix vector multiplication are adopted in programming. The storage schemes are analyzed in detail. The numerical results show that the designed parallel algorithm has good parallel performance on the high performance workstation cluster. This illustrates the power of parallel computing in solving large-scale problems much faster than on a single processor.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Barret, R., et al.: Templates for the Solution of Linear Systems, Building Blocks for Iterative Methods. SIAM, Philadelphia (1994)

    Google Scholar 

  2. Law, K.H.: A Parallel Finite Element Solution Method. Computers & Structures, 23(6), 845–858 (1986)

    Article  MATH  Google Scholar 

  3. George, E.K., et al.: Parallel Scientific Computing in C++ and MPI. Cambridge University Press (2003)

    Google Scholar 

  4. Pacheco, P.S.: Parallel Programming with MPI. Morgan Kaufmann (1997)

    Google Scholar 

  5. Allen, K.P.: Efficient Parallel Computing for Solving Linear Systems of Equations. Graduate Student Seminar, University of Maryland, Baltimore County (2003)

    Google Scholar 

  6. Brown, P.N., Hindmarsh, A.C.: Matrix-free methods for stiff systems of ODE’s. SIAM J. Numer, Anal, 23, 610–638 (1986)

    Article  MathSciNet  Google Scholar 

  7. Sorin, G.N., et al.: Load-Balanced Sparse Matrix-Vector Multiplication on Parallel Computers. Parallel and Distributed Computing, 46, 180–193 (1997)

    Google Scholar 

  8. Aliaga, J.I., Hernandez, V.: Symmetric sparse matrix-vector product on distributed memory multiprocessors. Conference on Parallel Computing and Transputer Applications, Barcelona, Spain (1992)

    Google Scholar 

  9. Ortigosa, E.M., et al.: Parallel scheduling of the PCG method for banded matrices rising from FDM/FEM. J. Parallel Distrib. Comput., 63, 1243–1256 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fu, C., Zhang, W., Yang, L. (2005). Parallel Computing for Linear Systems of Equations on Workstation Clusters. In: Zhang, W., Tong, W., Chen, Z., Glowinski, R. (eds) Current Trends in High Performance Computing and Its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27912-1_33

Download citation

Publish with us

Policies and ethics