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
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
A Comparative Study of Switching Methods in Multicomputer Networks
The Journal of Supercomputing
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Hi-index | 0.00 |
The switching technique determines how messages are propagated from source to destination, and has a great impact on network performance. Traditional flow control mechanisms such as Wormhole Switching (WS) realize very good performance, but prone to deadlock in the vicinity of faults. While techniques such as adaptive routing can alleviate the problem, it cannot by itself solve the problem. This has motivated the development of different switching techniques. The Scouting Switching (SS) has been suggested as an efficient switching method for reconciling the conflicting demands of communication performance and fault-tolerance in computer networks. In this paper, we present a novel mathematical model to predict communication delay of SS coupled with virtual channels and fully adaptive routing in 2-D torus networks. We have carried out extensive simulation experiments, the results of which are used to validate the proposed analytical model.