A performance model of fault-tolerant routing algorithm in interconnect networks

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

*Corresponding author for this work

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

1 Citation (Scopus)

Abstract

The Software-Based fault-tolerant routing [1] has been proposed as an efficient routing algorithm to preserve both performance and fault-tolerant demands in large-scale parallel computers and current multiprocessor systems-on-chip (Mp-SoCs). A number of different analytical models for fault-free routing algorithms have been suggested 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 model to capture the effects of failures in wormhole-switched k-ary n-cubes using Software-Based fault-tolerant routing algorithm. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Original languageEnglish
Title of host publicationComputational Science - ICCS 2006
Subtitle of host publication6th International Conference, Proceedings
PublisherSpringer Verlag
Pages744-752
Number of pages9
ISBN (Print)3540343792, 9783540343790
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventICCS 2006: 6th International Conference on Computational Science - Reading, United Kingdom
Duration: May 28 2006May 31 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3991 LNCS - I
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherICCS 2006: 6th International Conference on Computational Science
Country/TerritoryUnited Kingdom
CityReading
Period5/28/065/31/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A performance model of fault-tolerant routing algorithm in interconnect networks'. Together they form a unique fingerprint.

Cite this