Performance evaluation of fully adaptive routing for the torus interconnect networks

F. Safaei, A. Khonsari, M. Fathy, M. Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks. These algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential. This paper proposes a new analytical model to obtain message latency in wormhole-switched 2-D torus interconnect networks. The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages606-613
Number of pages8
Volume4490 LNCS
EditionPART 4
Publication statusPublished - 2007
Event7th International Conference on Computational Science, ICCS 2007 - Beijing, China
Duration: May 27 2007May 30 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 4
Volume4490 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th International Conference on Computational Science, ICCS 2007
CountryChina
CityBeijing
Period5/27/075/30/07

Fingerprint

Adaptive Routing
Interconnect
Routing algorithms
Adaptive algorithms
Computer networks
Performance Evaluation
Analytical models
Torus
Information Services
Communication
Experiments
Wormhole
Deterministic Algorithm
Computer Networks
Routing Algorithm
Parallel Computers
Adaptive Algorithm
Analytical Model
Simulation Experiment
Latency

Keywords

  • Adaptive routing algorithm
  • Parallel computer network
  • Torus interconnect networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Safaei, F., Khonsari, A., Fathy, M., & Ould-Khaoua, M. (2007). Performance evaluation of fully adaptive routing for the torus interconnect networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 4 ed., Vol. 4490 LNCS, pp. 606-613). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4490 LNCS, No. PART 4).

Performance evaluation of fully adaptive routing for the torus interconnect networks. / Safaei, F.; Khonsari, A.; Fathy, M.; Ould-Khaoua, M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4490 LNCS PART 4. ed. 2007. p. 606-613 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4490 LNCS, No. PART 4).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Safaei, F, Khonsari, A, Fathy, M & Ould-Khaoua, M 2007, Performance evaluation of fully adaptive routing for the torus interconnect networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 4 edn, vol. 4490 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 4, vol. 4490 LNCS, pp. 606-613, 7th International Conference on Computational Science, ICCS 2007, Beijing, China, 5/27/07.
Safaei F, Khonsari A, Fathy M, Ould-Khaoua M. Performance evaluation of fully adaptive routing for the torus interconnect networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 4 ed. Vol. 4490 LNCS. 2007. p. 606-613. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 4).
Safaei, F. ; Khonsari, A. ; Fathy, M. ; Ould-Khaoua, M. / Performance evaluation of fully adaptive routing for the torus interconnect networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4490 LNCS PART 4. ed. 2007. pp. 606-613 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 4).
@inproceedings{814970193f1340e59f5753d4584bcaa3,
title = "Performance evaluation of fully adaptive routing for the torus interconnect networks",
abstract = "Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks. These algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential. This paper proposes a new analytical model to obtain message latency in wormhole-switched 2-D torus interconnect networks. The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.",
keywords = "Adaptive routing algorithm, Parallel computer network, Torus interconnect networks",
author = "F. Safaei and A. Khonsari and M. Fathy and M. Ould-Khaoua",
year = "2007",
language = "English",
isbn = "9783540725893",
volume = "4490 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 4",
pages = "606--613",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 4",

}

TY - GEN

T1 - Performance evaluation of fully adaptive routing for the torus interconnect networks

AU - Safaei, F.

AU - Khonsari, A.

AU - Fathy, M.

AU - Ould-Khaoua, M.

PY - 2007

Y1 - 2007

N2 - Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks. These algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential. This paper proposes a new analytical model to obtain message latency in wormhole-switched 2-D torus interconnect networks. The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

AB - Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks. These algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential. This paper proposes a new analytical model to obtain message latency in wormhole-switched 2-D torus interconnect networks. The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

KW - Adaptive routing algorithm

KW - Parallel computer network

KW - Torus interconnect networks

UR - http://www.scopus.com/inward/record.url?scp=38149103493&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149103493&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540725893

VL - 4490 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 606

EP - 613

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -