Adaptive wormhole routing in tori with faults

A mathematical approach

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Fault-tolerance in a communication network is defined as the ability of the network to effectively utilize its redundancy in the presence of faulty components (i.e., nodes or links). New technologies of integration now enable the design of computing systems with hundreds and even thousands of independent processing elements which can cooperate on the solution of the same problem for a corresponding improvement in the execution time. However, as the number of processing units increases, concerns for reliability and continued operation of the system in the presence of failures must be addressed. Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in large-scale massively parallel computers, Multiprocessors System-on-Chip (MP-SoCs), and peer-to-peer communication networks. 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 novel analytical model to investigate the performance of five prominent adaptive routings in wormhole-switched 2-D tori fortified with an effective scheme suggested by Chalasani and Boppana [S. Chalasani, R.V. Boppana, Adaptive wormhole routing in tori with faults, IEE Proc. Comput. Digit. Tech. 42(6) (1995) 386-394], as an instance of a fault-tolerant method widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computers. Analytical approximations of the model are confirmed by comparing them with those obtained through simulation experiments.

Original languageEnglish
Pages (from-to)1468-1484
Number of pages17
JournalSimulation Modelling Practice and Theory
Volume17
Issue number9
DOIs
Publication statusPublished - Oct 2009

Fingerprint

Wormhole Routing
Adaptive Routing
Telecommunication networks
Torus
Fault
Parallel Computers
Communication Networks
Communication
Routing algorithms
Processing
Adaptive algorithms
Fault tolerance
Redundancy
Interprocessor Communication
Analytical models
Wormhole
Analytical Approximation
Peer-to-peer Networks
Adaptivity
Multiprocessor Systems

Keywords

  • Adaptive routing
  • Fault-tolerance
  • Interconnection networks
  • Message latency
  • Performance evaluation
  • Queuing theory
  • Routing algorithms
  • Torus
  • Virtual channels

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Modelling and Simulation

Cite this

Adaptive wormhole routing in tori with faults : A mathematical approach. / Safaei, F.; Khonsari, A.; Fathy, M.; Ould-Khaoua, M.

In: Simulation Modelling Practice and Theory, Vol. 17, No. 9, 10.2009, p. 1468-1484.

Research output: Contribution to journalArticle

@article{c0381dfc2d3040468f3a89e0166f9652,
title = "Adaptive wormhole routing in tori with faults: A mathematical approach",
abstract = "Fault-tolerance in a communication network is defined as the ability of the network to effectively utilize its redundancy in the presence of faulty components (i.e., nodes or links). New technologies of integration now enable the design of computing systems with hundreds and even thousands of independent processing elements which can cooperate on the solution of the same problem for a corresponding improvement in the execution time. However, as the number of processing units increases, concerns for reliability and continued operation of the system in the presence of failures must be addressed. Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in large-scale massively parallel computers, Multiprocessors System-on-Chip (MP-SoCs), and peer-to-peer communication networks. 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 novel analytical model to investigate the performance of five prominent adaptive routings in wormhole-switched 2-D tori fortified with an effective scheme suggested by Chalasani and Boppana [S. Chalasani, R.V. Boppana, Adaptive wormhole routing in tori with faults, IEE Proc. Comput. Digit. Tech. 42(6) (1995) 386-394], as an instance of a fault-tolerant method widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computers. Analytical approximations of the model are confirmed by comparing them with those obtained through simulation experiments.",
keywords = "Adaptive routing, Fault-tolerance, Interconnection networks, Message latency, Performance evaluation, Queuing theory, Routing algorithms, Torus, Virtual channels",
author = "F. Safaei and A. Khonsari and M. Fathy and M. Ould-Khaoua",
year = "2009",
month = "10",
doi = "10.1016/j.simpat.2009.06.005",
language = "English",
volume = "17",
pages = "1468--1484",
journal = "Simulation Modelling Practice and Theory",
issn = "1569-190X",
publisher = "Elsevier",
number = "9",

}

TY - JOUR

T1 - Adaptive wormhole routing in tori with faults

T2 - A mathematical approach

AU - Safaei, F.

AU - Khonsari, A.

AU - Fathy, M.

AU - Ould-Khaoua, M.

PY - 2009/10

Y1 - 2009/10

N2 - Fault-tolerance in a communication network is defined as the ability of the network to effectively utilize its redundancy in the presence of faulty components (i.e., nodes or links). New technologies of integration now enable the design of computing systems with hundreds and even thousands of independent processing elements which can cooperate on the solution of the same problem for a corresponding improvement in the execution time. However, as the number of processing units increases, concerns for reliability and continued operation of the system in the presence of failures must be addressed. Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in large-scale massively parallel computers, Multiprocessors System-on-Chip (MP-SoCs), and peer-to-peer communication networks. 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 novel analytical model to investigate the performance of five prominent adaptive routings in wormhole-switched 2-D tori fortified with an effective scheme suggested by Chalasani and Boppana [S. Chalasani, R.V. Boppana, Adaptive wormhole routing in tori with faults, IEE Proc. Comput. Digit. Tech. 42(6) (1995) 386-394], as an instance of a fault-tolerant method widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computers. Analytical approximations of the model are confirmed by comparing them with those obtained through simulation experiments.

AB - Fault-tolerance in a communication network is defined as the ability of the network to effectively utilize its redundancy in the presence of faulty components (i.e., nodes or links). New technologies of integration now enable the design of computing systems with hundreds and even thousands of independent processing elements which can cooperate on the solution of the same problem for a corresponding improvement in the execution time. However, as the number of processing units increases, concerns for reliability and continued operation of the system in the presence of failures must be addressed. Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in large-scale massively parallel computers, Multiprocessors System-on-Chip (MP-SoCs), and peer-to-peer communication networks. 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 novel analytical model to investigate the performance of five prominent adaptive routings in wormhole-switched 2-D tori fortified with an effective scheme suggested by Chalasani and Boppana [S. Chalasani, R.V. Boppana, Adaptive wormhole routing in tori with faults, IEE Proc. Comput. Digit. Tech. 42(6) (1995) 386-394], as an instance of a fault-tolerant method widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computers. Analytical approximations of the model are confirmed by comparing them with those obtained through simulation experiments.

KW - Adaptive routing

KW - Fault-tolerance

KW - Interconnection networks

KW - Message latency

KW - Performance evaluation

KW - Queuing theory

KW - Routing algorithms

KW - Torus

KW - Virtual channels

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

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

U2 - 10.1016/j.simpat.2009.06.005

DO - 10.1016/j.simpat.2009.06.005

M3 - Article

VL - 17

SP - 1468

EP - 1484

JO - Simulation Modelling Practice and Theory

JF - Simulation Modelling Practice and Theory

SN - 1569-190X

IS - 9

ER -