Skip to main content

Modelling of Adaptive Wormhole-Routed Hypercubes in the Presence of Broadcast Traffic

  • Chapter
High Performance Computing Systems and Applications

Abstract

Many analytical models of wormhole-routed networks have been proposed over the past few years. Most of these models, however, have been developed for unicast (or point-to-point) traffic. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. As a result, most existing studies have relied on simulation to evaluate the effect of collective communication algorithms on the network traffic. This paper presents a new analytical model for predicting message latency in the hypercube in the presence of broadcast communication. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Abraham, S., Padmanabhan, K. (1989). Performance of the direct binary n-cube network for multiprocessors. IEEE Trans. Computers, 38(7): 1001–1011.

    Article  Google Scholar 

  • Boura, Y., Das, C, Jacob, T. (1994) A performance model for adaptive routing in hypercubes, Proc. Int. Workshop Parallel processing, Pages 11–16.

    Google Scholar 

  • Cray Research Inc., The Gray T3E scalable parallel processing system, on Cray’s web page at http://www.cray.com/PUBLIC/product-info/T3E.

    Google Scholar 

  • Dally, W. (1990). Performance analysis of k-ary n-cubes interconnection networks, IEEE Trans. Computers 39 (6): 775–785.

    Article  MathSciNet  Google Scholar 

  • Dally, W. (1992). Virtual channel flow control, IEEE Trans. Parallel & Distributed Systems, 3(2): 194–205.

    Article  Google Scholar 

  • Dally, W., et al. (1994). The reliable router: A reliable and high performance communication substrate for parallel computers, Proc. 1st Workshop on Parallel Computer Routing & Communication, LCNS, Springer-Verlag, Pages 241–255.

    Google Scholar 

  • Dongarra, J., et al. (1993). Document for a standard message-passing interface, Message Passing Interface Forum.

    Google Scholar 

  • Draper, J., Ghosh, J. (1994). A Comprehensive analytical model for wormhole routing in multicomputer systems, J. Parallel & Distributed Computing 32, pp. 202–214, 1994.

    Article  Google Scholar 

  • Duato, J. (1993). A New theory of deadlock-free adaptive routing in wormhole routing networks, IEEE Trans. Parallel & Distributed Systems 4(12): 320–331.

    Article  Google Scholar 

  • Duato, J., Yalamanchili, S., Ni, L. (1997). Interconnection networks: An engineering approach, IEEE Computer Society Press.

    Google Scholar 

  • Johnsson, S., Ho, C. (1989). Optimum broadcasting and personalised communication in hypercubes,” IEEE Trans. Computers, vol. 38(9): 1249–1268.

    Article  MathSciNet  Google Scholar 

  • Kleinrock, L. (1975). Queueing Systems Vol. 1, John Wiley, New York.

    Google Scholar 

  • Laudon, J., Lenoski, D. (1997). The SGI Origin: a ccNUMA highly scalable server, Proc. ACM/IEEE 24th Int. Symp. Computer Architecture, Pages: 241–251.

    Google Scholar 

  • Malumbres, M., Duato, J. and Torrellas, J. (1996). An efficient implementation of tree-based multicast routing for distributed shared memory multiprocessor, Proc. 8 th IEEE Int. Symp. Parallel & Distributed Processing.

    Google Scholar 

  • McKinley, P., Xu, H., Esfahanian, A. and Ni, L. (1994) Unicast-based multicast communication in wormhole-routed networks, IEEE Trans. Parallel and Distributed Systems, Vol. 5(12): 1252–1265.

    Article  Google Scholar 

  • McKinley, P., Tsai, Y. and Robinson, D. (1995). Collective communication in wormhole-routed massively parallel computers, Computer, 28(12): 39–50.

    Article  Google Scholar 

  • Nugent, S. (1988). The iPSC/2 direct-connect communication technology, Proc. Conf. on Hypercube Concurrent Computers & Applications, 1: 51–60.

    Google Scholar 

  • Ould-Khaoua, M. (1999). A performance model for Duato’s fully-adaptive routing algorithm in k-ary n-cubes, IEEE Trans. Computers, 42(12): 1–8.

    MathSciNet  Google Scholar 

  • Panda, D., Singal, S. and Kesavan, R. (1999). Multidestination message passing in wormhole k-ary n-cube networks with base routing conformed paths, IEEE Trans. Parallel and Distributed Systems, 10(1): 76–96.

    Article  Google Scholar 

  • Seitz, C. (1985). The Cosmic Cube, CACM, 28(1): 22–33.

    Article  MathSciNet  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 Science+Business Media New York

About this chapter

Cite this chapter

Shahrabi, A., Mackenzie, L.M., Ould-Khaoua, M. (2002). Modelling of Adaptive Wormhole-Routed Hypercubes in the Presence of Broadcast Traffic. In: Dimopoulos, N.J., Li, K.F. (eds) High Performance Computing Systems and Applications. The Kluwer International Series in Engineering and Computer Science, vol 657. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0849-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0849-6_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5269-3

  • Online ISBN: 978-1-4615-0849-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics