A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
Dynamically Configurable Message Flow Control for Fault-Tolerant Routing
IEEE Transactions on Parallel and Distributed Systems
A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes
IEEE Transactions on Computers
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Message Switching Based on Wormhole Switching and Backtracking
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
Performance analysis of fault-tolerant routing algorithm in wormhole-switched interconnections
The Journal of Supercomputing
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Hi-index | 0.00 |
In this paper, we introduce a new variant of WS which makes any adaptive routing algorithm augmented with virtual channels tolerate multiple fault regions. More specifically, we propose a mathematical model for this switching mechanism using Markov chain to calculate the probability of header message blocking and to capture the traffic rates on channels in the presence of faulty components. Simulation results based on the network topology confirm the validity of the analytical approximation and demonstrate the localizer efficiency.