Skip to main content
SpringerLink
Log in

Modeling Latency in Deterministic Wormhole-Routed Hypercubes under Hot-Spot Traffic

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Analytical models of deterministic routing in common wormhole-routed networks, such as the hypercube, have been widely reported in the literature. However, all these models have been discussed for the uniform traffic pattern. The performance of deterministic routing under other important non-uniform communication patterns, such as hot-spots, has often been analyzed through simulation. The main advantage of the analytical approach over simulation is that the analytical models can be used to obtain performance results for large systems that are infeasible by simulation due to the excessive computation demands on conventional computers. This paper presents the first analytical model of deterministic routing in the hypercube in the presence of hot-spot traffic. Simulation results confirm that the proposed model predicts message latency with a reasonable degree of accuracy under different traffic conditions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Agrawal. Limits on interconnection network performance. IEEE Trans. Parallel & Distributed Systems, 2:398–412, 1991.

    Google Scholar 

  2. E. Anderson, J. Brooks, C. Grassl, and S. Scott. Performance of the Cray T3E multiprocessor. Proc. Supercomputing Conference, 1997.

  3. B. Ciciani, M. Colajanni, and C. Paolucci. Performance evaluation of deterministic wormhole routing in k-ary n-cubes. Parallel Computing, 24(14):2053–2075, 1998.

    Google Scholar 

  4. A. A. Chien. A cost and speed model for k-ary n-cube wormhole routers. IEEE Trans. Parallel & Distributed Systems, 9(2):150–162, 1998.

    Google Scholar 

  5. W. J. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Computers, 36(5):547–553, 1987.

    Google Scholar 

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

    Google Scholar 

  7. J. T. Draper and J. Ghosh. A comprehensive analytical model for wormhole routing in multicomputer systems. J. Parallel & Distributed Computing, 23:202–214, 1994.

    Google Scholar 

  8. J. Duato. A new theory of deadlock-free adaptive routing in wormhole routing networks. IEEE Trans. Parallel & Distributed Systems, 4(12):1320–1331, 1993.

    Google Scholar 

  9. M. Fillo, S. W. Keckler, W. J. Dally, N. P. Carter, A. Chang, Y. Gurevich, and W. S. Lee. The M-machine multicomputer. Int. Journal Parallel Programming, 25(3):183–212, 1997.

    Google Scholar 

  10. R. Greenberg and L. Guan. Modeling and comparison of wormhole routed mesh and torus networks. Proc. 9th IASTED Int. Conf. Parallel & Distributed Computing and Systems, 1997.

  11. W. J. Guan, W. K. Tsai, and D. Blough. An analytical model for wormhole routing in multicomputer interconnection networks. Proc. Int. Conference on Parallel Processing, 650–654, 1993.

  12. R. E. Kessler and J. L. Swarszmeier. Cray T3D: A new dimension for Cray research. in Compcon, 176– 182, Spring 1993.

  13. J. Kim and C. R. Das. Hypercube communication delay with wormhole routing. IEEE Trans. Computers, 43(7):806–814, 1994.

    Google Scholar 

  14. L. Kleinrock. Queueing Systems, John Wiley, New York, 1975.

    Google Scholar 

  15. n Cube-2, nCUBE company, nCUBE 6400 processor manual, 1990.

  16. S. F. Nugent. The iPSC/2 direct-connect communication technology. Proc. Conference on hypercube concurrent computers and applications, 1:51–60, 1988.

    Google Scholar 

  17. M. Ould-Khaoua and H. Sarbazi-Azad. An analytical model of adaptive wormhole routing in hypercubes in the presence of hot-spot traffic. IEEE Trans. Parallel & Distributed Systems, 12(3):283–288, 2001.

    Google Scholar 

  18. G. J. Pfister and V. A. Norton. Hot-spot contention and combining in multistage interconnection networks. IEEE Trans. Computers, 34(10):943–948, 1985.

    Google Scholar 

  19. H. Sarbazi-Azad, L. Mackenzie, and M. Ould-Khaoua. Analytical modeling of wormhole-routed k-ary n-cubes in the presence of hot-spot traffic. IEEE Trans. Computers, 50(7):623–634, 2001.

    Google Scholar 

  20. C. L. Seitz. The cosmic cube. Communication of the ACM, 28(1):22–33, 1985.

    Google Scholar 

  21. A. S. Vaidya, et al. Impact of virtual channels and adaptive routing on application performance. IEEE Trans. Parallel & Distributed Systems, 12(2):223–237, 2001.

    Google Scholar 

  22. H. Xu, et al. Efficient implementation of barrier synchronisation in wormhole-routed hypercube multicomputers. J. Parallel & Distributed Computing, 16:172–184, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math/Computer Department, UAE University, Al Ain, PO Box 17551

    S. Loucif

  2. Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ, UK

    M. Ould-khaoua

Authors
  1. S. Loucif
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Ould-khaoua
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Loucif, S., Ould-khaoua, M. Modeling Latency in Deterministic Wormhole-Routed Hypercubes under Hot-Spot Traffic. The Journal of Supercomputing 27, 265–278 (2004). https://doi.org/10.1023/B:SUPE.0000011387.24259.d1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SUPE.0000011387.24259.d1

Search

Navigation