Skip to main content

Fast Collective Communication Algorithms for Reflective Memory Network Clusters

  • Conference paper
Network-Based Parallel Computing. Communication, Architecture, and Applications (CANPC 2000)

Abstract

In this paper, we present algorithms for efficiently implementing three collective communication operations on reflective memory network clusters: Broadcast, Barrier Synchronization and All-Reduce. These algorithms have been implemented as an extension to the Bill-Board Protocol, a low-latency communication protocol for reflective memory networks that we previously developed [6,7]. Simulated performance results are presented for these algorithms. The performance of the algorithms is evaluated in detail. A comparative study with Myrinet, a popular point-to-point switched interconnect for clusters is also presented.

This research is supported in part by an NSF Career Award MPI-9502294, NSF Grant CCR-9704512, an Ameritech Faculty Fellowship award, and grants from the Ohio Board of Regents.

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Anderson, T., Culler, D., Patterson, D.: A Case for Networks of Workstations (NOW). IEEE Micro, 54–64 (February 1995)

    Google Scholar 

  2. Becker, D.J., et al.: Beowulf: A Parallel Workstation for Scientific Computation. In: International Conference on Parallel Processing (1995)

    Google Scholar 

  3. Boden, N.J., Cohen, D., et al.: Myrinet: A Gigabit-per-Second Local Area Network. IEEE Micro, 29–35 (February 1995)

    Google Scholar 

  4. Pakin, S., Lauria, M., Chien, A.: High Performance Messaging on Workstations: Illinois Fast Messages (FM). In: Proceedings of Supercomputing 1995 (1995)

    Google Scholar 

  5. Von Eicken, L., Basu, A., Buch, V., Vogels, W.: U-Net: A User-level Network Interface for Parallel and Distributed Computing. In: ACM Symposium on Operating Systems and Principles (1995)

    Google Scholar 

  6. Jacunski, M.G., Moorthy, V., Ware, P.P., Pillai, M.L., Panda, D.K., Sadayappan, P.: Low Latency Message-Passing for Reflective Memory Networks. In: Sivasubramaniam, A. (ed.) CANPC 1999. LNCS, vol. 1602, pp. 211–224. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Moorthy, V., Jacunski, M.G., Pillai, M.L., Ware, P.P., Panda, D.K., Page Jr., L.W., Sadayappan, P., Nagarajan, V., Daniel, J.: Low Latency Message-Passing on Workstation Clusters using SCRAMNet. In: Proceedings of International Parallel Processing Symposium (IPPS), pp. 148–152 (1999)

    Google Scholar 

  8. Jovanovic, M., Milutnovic, V.: An Overview of Reflective Memory Systems. IEEE Concurrency 7(2), 56–64 (1999)

    Article  Google Scholar 

  9. Liu, M.L.: Distributed Loop Computer Networks. In: Advances in Computers. Academic Press, London (1978)

    Google Scholar 

  10. Msra, J.: Phase Synchronization. Information Processing Letters 38, 101–105 (1991)

    Article  Google Scholar 

  11. Bohman, L.: Shared Memory Computing Architectures for Real-Lime Simulation - Simplicity and Elegance. Technical Report, Systran Corporation (1994)

    Google Scholar 

  12. VMIC’s Reflective Memory Network, VME Mcrosystems International Corp. (1995)

    Google Scholar 

  13. Gillet, R.: Memory Channel Network for PCI. IEEE Micro 16(1), 12–18 (1996)

    Article  MathSciNet  Google Scholar 

  14. Blumrich, M.A., Dubnicki, C., Felten, E.W., Li, K.: Protected User-level DMA for the SHRIMP interface. In: Proceedings of the International Symposium on High Performance Computer Architecture, HPCA-2 (1996)

    Google Scholar 

  15. Wittie, L., Hermannsson, G., Li, A.: Eager Sharing for Efficient Massive Parallelism. In: Proceedings of the International Conference on Parallel Processing, ICPP (1992)

    Google Scholar 

  16. Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. The IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  17. Stunkel, C.B., Sivaram, R., Panda, D.K.: Implementing Multidestination Worms in Switch-Based Parallel Systems: Architectural Alternatives and their Impact. In: International Symposium on Computer Architecture, ISCA 1997 (1997)

    Google Scholar 

  18. McKinley, P.K., Xu, H., Esfahanian, A.-H., Ni, L.M.: Unicast-Based Multicast Communication in Wormhole-Routed Direct Networks. IEEE Transactions on Parallel and Distributed Systems 5(12), 1254–1265 (1994)

    Article  Google Scholar 

  19. Ranka, S., Sahni, S.: Hypercube Algorithms for Image Processing and Pattern Recognition. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moorthy, V., Panda, D.K., Sadayappan, P. (2000). Fast Collective Communication Algorithms for Reflective Memory Network Clusters. In: Falsafi, B., Lauria, M. (eds) Network-Based Parallel Computing. Communication, Architecture, and Applications. CANPC 2000. Lecture Notes in Computer Science, vol 1797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720115_8

Download citation

  • DOI: https://doi.org/10.1007/10720115_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67879-3

  • Online ISBN: 978-3-540-44655-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics