Performance analysis of fault-tolerant routing algorithm in wormhole-switched interconnections

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

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

With nowadays popularity of large-scale parallel computers, Multiprocessors System-on-Chip (MP-SoCs), multicomputers, cluster computers and peer-to-peer communication networks, fault-tolerant routing becomes an important issue in developing these systems. Fault-tolerant routing algorithms in such systems aim at providing continuous operations in the presence of one or more failures by allowing the graceful degradation of system. The Software-Based fault-tolerant routing scheme has been suggested as an efficient routing algorithm to preserve both communication performance and fault-tolerant demands in parallel computer systems. To study network performance, a number of different analytical models for fault-free routing algorithms have been proposed in the past literature. However, there has not been reported any similar analytical model of fault-tolerant routing in the presence of faulty components. This paper presents a new analytical modeling approach for determining the effects of failures in wormhole-switched 2-D tori using the fault-tolerant Software-Based scheme. More specifically, we describe a general model to derive mathematical expressions to investigate the performance behavior of routing algorithms confronting convex (|-shaped, □-shaped) or concave (U-shaped, +-shaped, T-shaped, H-shaped) faulty regions. The model is validated through comprehensive simulation experiments for different types of failures.

Original languageEnglish
Pages (from-to)215-245
Number of pages31
JournalJournal of Supercomputing
Volume41
Issue number3
DOIs
Publication statusPublished - Sep 2007

Fingerprint

Fault-tolerant Routing
Wormhole
Routing algorithms
Routing Algorithm
Interconnection
Performance Analysis
Parallel Computers
Fault-tolerant
Analytical Model
Analytical models
Analytical Modeling
Multicomputers
Software
Peer-to-peer Networks
Multiprocessor Systems
Network Performance
Network performance
Communication Networks
Simulation Experiment
Telecommunication networks

Keywords

  • Adaptive routing
  • Deterministic routing
  • Fault patterns
  • Fault-tolerance
  • Parallel systems
  • Performance modeling
  • Queuing theory
  • Software-Based routing
  • Torus
  • Virtual channels

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Performance analysis of fault-tolerant routing algorithm in wormhole-switched interconnections. / Safaei, F.; Khonsari, A.; Fathy, M.; Ould-Khaoua, M.

In: Journal of Supercomputing, Vol. 41, No. 3, 09.2007, p. 215-245.

Research output: Contribution to journalArticle

@article{f41b942f9afb4934b065961e564c58c5,
title = "Performance analysis of fault-tolerant routing algorithm in wormhole-switched interconnections",
abstract = "With nowadays popularity of large-scale parallel computers, Multiprocessors System-on-Chip (MP-SoCs), multicomputers, cluster computers and peer-to-peer communication networks, fault-tolerant routing becomes an important issue in developing these systems. Fault-tolerant routing algorithms in such systems aim at providing continuous operations in the presence of one or more failures by allowing the graceful degradation of system. The Software-Based fault-tolerant routing scheme has been suggested as an efficient routing algorithm to preserve both communication performance and fault-tolerant demands in parallel computer systems. To study network performance, a number of different analytical models for fault-free routing algorithms have been proposed in the past literature. However, there has not been reported any similar analytical model of fault-tolerant routing in the presence of faulty components. This paper presents a new analytical modeling approach for determining the effects of failures in wormhole-switched 2-D tori using the fault-tolerant Software-Based scheme. More specifically, we describe a general model to derive mathematical expressions to investigate the performance behavior of routing algorithms confronting convex (|-shaped, □-shaped) or concave (U-shaped, +-shaped, T-shaped, H-shaped) faulty regions. The model is validated through comprehensive simulation experiments for different types of failures.",
keywords = "Adaptive routing, Deterministic routing, Fault patterns, Fault-tolerance, Parallel systems, Performance modeling, Queuing theory, Software-Based routing, Torus, Virtual channels",
author = "F. Safaei and A. Khonsari and M. Fathy and M. Ould-Khaoua",
year = "2007",
month = "9",
doi = "10.1007/s11227-007-0114-8",
language = "English",
volume = "41",
pages = "215--245",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Performance analysis of fault-tolerant routing algorithm in wormhole-switched interconnections

AU - Safaei, F.

AU - Khonsari, A.

AU - Fathy, M.

AU - Ould-Khaoua, M.

PY - 2007/9

Y1 - 2007/9

N2 - With nowadays popularity of large-scale parallel computers, Multiprocessors System-on-Chip (MP-SoCs), multicomputers, cluster computers and peer-to-peer communication networks, fault-tolerant routing becomes an important issue in developing these systems. Fault-tolerant routing algorithms in such systems aim at providing continuous operations in the presence of one or more failures by allowing the graceful degradation of system. The Software-Based fault-tolerant routing scheme has been suggested as an efficient routing algorithm to preserve both communication performance and fault-tolerant demands in parallel computer systems. To study network performance, a number of different analytical models for fault-free routing algorithms have been proposed in the past literature. However, there has not been reported any similar analytical model of fault-tolerant routing in the presence of faulty components. This paper presents a new analytical modeling approach for determining the effects of failures in wormhole-switched 2-D tori using the fault-tolerant Software-Based scheme. More specifically, we describe a general model to derive mathematical expressions to investigate the performance behavior of routing algorithms confronting convex (|-shaped, □-shaped) or concave (U-shaped, +-shaped, T-shaped, H-shaped) faulty regions. The model is validated through comprehensive simulation experiments for different types of failures.

AB - With nowadays popularity of large-scale parallel computers, Multiprocessors System-on-Chip (MP-SoCs), multicomputers, cluster computers and peer-to-peer communication networks, fault-tolerant routing becomes an important issue in developing these systems. Fault-tolerant routing algorithms in such systems aim at providing continuous operations in the presence of one or more failures by allowing the graceful degradation of system. The Software-Based fault-tolerant routing scheme has been suggested as an efficient routing algorithm to preserve both communication performance and fault-tolerant demands in parallel computer systems. To study network performance, a number of different analytical models for fault-free routing algorithms have been proposed in the past literature. However, there has not been reported any similar analytical model of fault-tolerant routing in the presence of faulty components. This paper presents a new analytical modeling approach for determining the effects of failures in wormhole-switched 2-D tori using the fault-tolerant Software-Based scheme. More specifically, we describe a general model to derive mathematical expressions to investigate the performance behavior of routing algorithms confronting convex (|-shaped, □-shaped) or concave (U-shaped, +-shaped, T-shaped, H-shaped) faulty regions. The model is validated through comprehensive simulation experiments for different types of failures.

KW - Adaptive routing

KW - Deterministic routing

KW - Fault patterns

KW - Fault-tolerance

KW - Parallel systems

KW - Performance modeling

KW - Queuing theory

KW - Software-Based routing

KW - Torus

KW - Virtual channels

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

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

U2 - 10.1007/s11227-007-0114-8

DO - 10.1007/s11227-007-0114-8

M3 - Article

VL - 41

SP - 215

EP - 245

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 3

ER -