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

skip to main content
10.1145/952532.952726acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Performance prediction of wormhole switching in hypercubes with bursty traffic pattern

Published: 09 March 2003 Publication History

Abstract

Wormhole switching has been extensively deployed in the current-generation of high-end parallel systems. The performance of wormhole switching in hypercubes has been primarily investigated under the assumption that traffic load follows a Poisson arrival process. However, many studies have shown that traffic in parallel computation environments can exhibit a high degree of burstiness and the Poisson arrival process is unable to model the behaviour of bursty traffic. This paper proposes a new analytical model for wormhole-switched hypercubes under bursty traffic. Simulation experiments demonstrate that the proposed model exhibits a good degree of accuracy under various operating conditions.

References

[1]
W. J. Dally, Performance analysis of k-ary n-cubes interconnection networks, IEEE TC, 39(6), 775--785, 1990.
[2]
W. J. Dally, Virtual channel flow control, IEEE TPDS, 3(2), 194--205, 1992.
[3]
J. T. Draper, J. Ghosh, A comprehensive analytical model for wormhole routing in multicomputer systems, JPDC, 32(2), 202--214, 1994.
[4]
J. Duato, A new theory of deadlock-free adaptive routing in wormhole routing networks, IEEE TPDS, 4(12), 1320--1331, 1993.
[5]
J. Duato, S. Yalamanchili, L. Ni, Interconnection networks: An engineering approach, IEEE CS Press, 1997.
[6]
W. Fischer, K. Meier-Hellstern, The Markov-modulated Poisson process (MMPP) cookbook, Performance Evaluation, 18(2), 149--171, 1993.
[7]
J. Kim, C. R. Das, Hypercube communication delay with wormhole routing, IEEE TC, 43(7), 806--814, 1994.
[8]
L. Kleinrock, Queueing Systems: Theory, Vol. 1, John Wiley & Sons, New York, 1975.
[9]
S. Loucif, M. Ould-Khaoua, L. M. Mackenzie, Modelling fully-adaptive routing in hypercubes, Telecommunication Systems, 13(1), 111--118, 2000.
[10]
D. M. Lucantoni, The BMAP/G/1 queue: A tutorial, Proc. Performance Evaluation of Computer and Comm. Systems, LNCS 729, Springer-Verlag, 330--358, 1993.
[11]
G. Min, M. Ould-Khaoua, Performance analysis of wormhole switching in k-ary n-cubes under multimedia traffic, Proc. 15th IPDPS, IEEE CS Press, CD-ROM, 2001.
[12]
G. Min, M. Ould-Khaoua, A queuing model for pipelined circuit-switched networks with the MMPP traffic, Proc. 9th MASCOTS, IEEE CS Press, 259--266, 2001.
[13]
M. F. Neuts, J. Li, The Bernoulli splitting of a Markovian arrival process, http://www.maths.adelaide.edu.au/jli/papers/split.pdf
[14]
M. Ould-Khaoua, A performance model for Duato's fully adaptive routing algorithm in k-ary n-cubes, IEEE TC, 48(12), 1--8, 1999.
[15]
S. Shah-Heydari, T. Le-Ngoc, MMPP models for multimedia traffic, Telecommunication Systems, 15(3), 273--293, 2000.
[16]
F. Silla, M. P. Malumbres, J. Duato, D. Dai, D. K. Panda, Impact of adaptivity on the behavior of networks of workstations under bursty traffic, Proc. ICPP'1998, IEEE CS Press, 88--95, 1998.

Cited By

View all
  • (2003)Evaluating switching techniques for binary n-cubes under SPP traffic17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.10.1109/AINA.2003.1192969(689-694)Online publication date: 2003

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '03: Proceedings of the 2003 ACM symposium on Applied computing
March 2003
1268 pages
ISBN:1581136242
DOI:10.1145/952532
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 March 2003

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. bursty traffic
  2. interconnection networks
  3. parallel systems
  4. performance modelling

Qualifiers

  • Article

Conference

SAC03
Sponsor:
SAC03: ACM Symposium on Applied Computing
March 9 - 12, 2003
Florida, Melbourne

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 26 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2003)Evaluating switching techniques for binary n-cubes under SPP traffic17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.10.1109/AINA.2003.1192969(689-694)Online publication date: 2003

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media