Topological Properties of Hypercubes
IEEE Transactions on Computers
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
METRO: a router architecture for high-performance, short-haul routing networks
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Ariadne—an adaptive router for fault-tolerant multicomputers
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes
IEEE Transactions on Computers
An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
MMR: A High-Performance Multimedia Router - Architecture and Design Trade-Offs
HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Hi-index | 0.00 |
Multicomputer systems are more susceptible to failure than conventional uniprocessor machines. This is because as the system size scales up, the probability of a component failure also increases. It is therefore essential to use fault-tolerant routing that allows messages to reach their destinations even in the presence of faults. Pipelined Circuit Switching (PCS) that has been employed as an efficient switching method in the design of fault-tolerant routing algorithm for reliable interprocessor networks can route a message from source to destination, even in the presence of faulty components. The analytical model of PCS for common networks (e.g., hypercube) in the absence of faulty components has recently been reported in the literature. However, none of these analytical models attempt to capture the effects of faulty nodes or links in the performance of the networks. This paper proposes a new analytical model of PCS, in the presence of faulty nodes, in the hypercube networks augmented with virtual channels. The model makes latency predictions that are in good agreement with those obtained from simulation experiments.