Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A comparison of adaptive wormhole routing algorithms
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant wormhole routing in tori
ICS '94 Proceedings of the 8th international conference on Supercomputing
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Configurable flow control mechanisms for fault-tolerant routing
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Distributed, Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks
IEEE Transactions on Computers
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
The Reliable Router: A Reliable and High-Performance Communication Substrate for Parallel Computers
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Scouting: Fully Adaptive, Deadlock-Free Routing in Faulty Pipelined Networks
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
The Message Flow Model for Routing in Wormhole-Routed Networks
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
| Hi-index | 0.00 |
This paper investigates the fault tolerance problem in direct networks. Conservative flow control mechanisms such as Pipelined Circuit Switching (PCS) ensure the existence of a path to the destination before transmission. This ensures achieving reliable fault-tolerant system on the expense of performance. Optimistic flow control mechanisms such as Wormhole Switching (WS) realize very good performance, but they are very sensitive to the existence of deadlock of the presence of faults. This paper presents a new adaptive fault tolerant protocol in wormhole switched networks. In the fault free region, messages use WS for routing. However, when messages encounter faults, some restrictions are used with controlled buffering of the message in the node's local memory to ensure deadlock free fault-tolerance routing. The router and virtual channel models are simplified. Distributed random faulty nodes can be fully handled. A fully adaptive three-phase protocol is proposed and compared via simulation to the two phase (TP) protocol. The results show that the algorithm achieves higher throughput at different injection rates and lower latency over a wide range of injection rates.