Skip to main content

Optimization of Parallel Algorithms on Cluster of SMP’s

  • Conference paper
  • First Online:
Applied Parallel Computing (PARA 2002)

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

Included in the following conference series:

  • 475 Accesses

Abstract

The clusters of SMP using fast networks, such as the Myricom’s Myrinet, have emerged as important platforms for high performance computing. Although their peak advertised performance is very high, their real performance may be much lower than the peak advertised performance for many applications. To achieve high performance, we need to take advantages of both SMP and cluster architectures. Based on the HPM model for parallel computing, the performance of clusters of SMP systems is analyzed, and principles to optimize parallel algorithms (both from the parallelism and locality point of view) are proposed. The influence of memory hierarchies on the performance is highly emphasized. Some practical examples on commercial clusters of SMPs systems Dawning D2000-2 and D3000 are also given.

Supported by the National Natural Science Foundation of China (Grand 69933020)

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Boden N. J., Cohen D., Felderman R. E., Kulawik A. E., Seitz C. L., Seizovic J. N., Su W.: Myrinet-A Gigabit-per-Second Local-Area Network. IEEE Micro. Vol. 15, February (1995) 29–38

    Google Scholar 

  2. Bell G., Gray J.: High Performance Computing: Crays, Clusters, and Centers, What Next? August (2001) MSR-TR-2001-76

    Google Scholar 

  3. Qiao X. Z.: HPM-A Hierarchical Model for Parallel Computations. Internal Report, NCIC (2002)

    Google Scholar 

  4. Culler D.E., Singh J. P., Gupta A.: Parallel Architecture: A Hardware/Software Approach. Morgan Kaufman, San Francisco (1999)

    Google Scholar 

  5. Leopold C.: Parallel and Distributed Computing. John Wiley & Sons, New York (2001)

    Google Scholar 

  6. Luo X. G., Jiang W., Qiao X. Z.: The Performance of the Library ESSL on the Dawning Systems. NCIC Report (1999)

    Google Scholar 

  7. NCIC: Cluster Dawn2000. NCIC, Beijing (2000)

    MATH  Google Scholar 

  8. NCIC: Cluster Dawn3000. NCIC, Beijing (2001)

    Google Scholar 

  9. Xavier C., Iyengar S. S.: Introduction to Parallel Algorithms. John Wiley & Sons, New York (1998)

    MATH  Google Scholar 

  10. Kluzek E. B.: User’s Guide to NCAR CCM3.6. NCAR Technical Report (1996)

    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

Qiao, X. (2002). Optimization of Parallel Algorithms on Cluster of SMP’s. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-48051-X_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43786-4

  • Online ISBN: 978-3-540-48051-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics