Nothing Special   »   [go: up one dir, main page]

Skip to main content

The Parallel Algorithm of Conjugate Gradient Method

  • Conference paper
  • First Online:
Advanced Environments, Tools, and Applications for Cluster Computing (IWCC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2326))

Included in the following conference series:

Abstract

In this paper authors investigate parallel implementation of a conjugate gradient algorithm used for solving a large system of linear algebraic equations. Computations were carried out using a heterogeneous cluster of PCs, working under control of Windows 2000 operating system and an MPI library, as well as a massive parallel processor machine Hitachi SR-2201. The authors implemented two versions of the algorithm in cluster computations: an algorithm with equally distributed data among all processors, and another one with distribution depending on the speed of each PC processor. Speedup in all implementations was investigated and the conclusions were drawn.

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

Access this chapter

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

eBook
USD 13.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. A. Chtchelkanova, C. Edwards, J. Gunnels, G. Morrow, J. Overleft, R. van de Geijn: Towards Usable and Lean Parallel Linear Algebra Libraries. CS-TR-96-09, 1996.

    Google Scholar 

  2. A. Gupta, V. Kumar, A. Sameh: Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers. IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 5, pp. 455–469, 1995.

    Article  Google Scholar 

  3. Jianming Jin: The Finite Element Method in Electromagnetics. John Wiley, New York, 1993.

    MATH  Google Scholar 

  4. A. Jordan: Theoretical Background of Parallel Electromagnetic Field Computations. The 10th International Symposium on Applied Electromagnetics and Mechanics, pp. 193–194, May 13–16, 2000, Tokyo, Japan.

    Google Scholar 

  5. P. S. Pacheco: A User’s Guide to MPI. USFCA, 1998.

    Google Scholar 

  6. W. Peterson: Fixed point technique in computing eddy currents within ferromagnetic conductors exposed to transverse magnetic field. Archives of electrical engineering, Vol. XLVII, no. 1, pp. 57–68, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jordan, A., Bycul, R.P. (2002). The Parallel Algorithm of Conjugate Gradient Method. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds) Advanced Environments, Tools, and Applications for Cluster Computing. IWCC 2001. Lecture Notes in Computer Science, vol 2326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47840-X_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-47840-X_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43672-0

  • Online ISBN: 978-3-540-47840-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics