Performance prediction of wormhole switching in hypercubes with bursty traffic pattern

G. Min, M. Ould-Khaoua, J.D. Ferguson

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

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.
LanguageEnglish
Title of host publicationProceedings of the 2003 ACM symposium on Applied computing
Pages985-989
Number of pages4
DOIs
Publication statusPublished - 2003

Fingerprint

Analytical models
Experiments

Keywords

  • wormhole
  • parallel computing
  • hypercubes
  • burstiness

Cite this

Min, G., Ould-Khaoua, M., & Ferguson, J. D. (2003). Performance prediction of wormhole switching in hypercubes with bursty traffic pattern. In Proceedings of the 2003 ACM symposium on Applied computing (pp. 985-989) https://doi.org/10.1145/952532.952726
Min, G. ; Ould-Khaoua, M. ; Ferguson, J.D. / Performance prediction of wormhole switching in hypercubes with bursty traffic pattern. Proceedings of the 2003 ACM symposium on Applied computing. 2003. pp. 985-989
@inbook{c146e4a63c31434da9224604fa7a569a,
title = "Performance prediction of wormhole switching in hypercubes with bursty traffic pattern",
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.",
keywords = "wormhole, parallel computing, hypercubes, burstiness",
author = "G. Min and M. Ould-Khaoua and J.D. Ferguson",
year = "2003",
doi = "10.1145/952532.952726",
language = "English",
isbn = "1-58113-624-2",
pages = "985--989",
booktitle = "Proceedings of the 2003 ACM symposium on Applied computing",

}

Min, G, Ould-Khaoua, M & Ferguson, JD 2003, Performance prediction of wormhole switching in hypercubes with bursty traffic pattern. in Proceedings of the 2003 ACM symposium on Applied computing. pp. 985-989. https://doi.org/10.1145/952532.952726

Performance prediction of wormhole switching in hypercubes with bursty traffic pattern. / Min, G.; Ould-Khaoua, M.; Ferguson, J.D.

Proceedings of the 2003 ACM symposium on Applied computing. 2003. p. 985-989.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Performance prediction of wormhole switching in hypercubes with bursty traffic pattern

AU - Min, G.

AU - Ould-Khaoua, M.

AU - Ferguson, J.D.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - wormhole

KW - parallel computing

KW - hypercubes

KW - burstiness

UR - http://dx.doi.org/10.1145/952532.952726

U2 - 10.1145/952532.952726

DO - 10.1145/952532.952726

M3 - Chapter

SN - 1-58113-624-2

SP - 985

EP - 989

BT - Proceedings of the 2003 ACM symposium on Applied computing

ER -

Min G, Ould-Khaoua M, Ferguson JD. Performance prediction of wormhole switching in hypercubes with bursty traffic pattern. In Proceedings of the 2003 ACM symposium on Applied computing. 2003. p. 985-989 https://doi.org/10.1145/952532.952726