Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Automatic reconfiguration in Autonet
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks
IEEE Transactions on Parallel and Distributed Systems
A New Methodology to Computer Deadlock-Free Routing Tables for Irregular Networks
CANPC '00 Proceedings of the 4th International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems
An Efficient and Deadlock-Free Network Reconfiguration Protocol
IEEE Transactions on Computers
A new distributed management mechanism for ASI based networks
Computer Communications
A model for the development of AS fabric management protocols
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Autonet: a high-speed, self-configuring local area network using point-to-point links
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Computer performance has significantly increased in recent years and, as a consequence, communication subsystems have become bottlenecks within systems. To alleviate this problem, current high-performance distributed systems use switch-based interconnection networks. In order to support fault tolerance in such interconnects we previously proposed a management mechanism that included distributed calculation of new routes after a topology change. The routing function was updated statically, however, and thus the main drawback of the mechanism was a negative impact on the network service availability. In order to reduce (or even avoid) this problem we present a dynamic scheme to update the routing function. As opposed to most of the recently proposed dynamic schemes, ours does not need extra network resources (such as virtual channels) and has low computational complexity. Our new dynamic scheme is suitable for both source and distributed routing networks, and does neither restrict the injection of packets nor the updating of the routing function during the topology change assimilation.