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
AN - SCOPUS:34547158093
SN - 0920-8542
VL - 41
SP - 215
EP - 245
JO - Journal of Supercomputing
JF - Journal of Supercomputing
IS - 3
ER -