Title
A performance model of fault-tolerant routing algorithm in interconnect networks
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.
Year
DOI
Venue
2006
10.1007/11758501_99
International Conference on Computational Science (1)
Keywords
Field
DocType
fault-tolerant demand,software-based fault-tolerant,efficient routing algorithm,fault-tolerant routing algorithm,similar analytical model,software-based fault-tolerant routing,fault-free routing algorithm,new analytical model,different analytical model,performance model,analytical result,fault-tolerant routing,simulation experiment,fault tolerant,parallel computer
Multipath routing,Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Static routing,Path vector protocol,Computer science,Parallel computing,Destination-Sequenced Distance Vector routing,Distance-vector routing protocol,Distributed computing
Conference
Volume
ISSN
ISBN
3991
0302-9743
3-540-34379-2
Citations 
PageRank 
References 
1
0.37
7
Authors
4
Name
Order
Citations
PageRank
F. Safaei15712.30
M. Fathy210.37
A. Khonsari313617.89
M. Ould-Khaoua444043.78