A New Strategy To Improve Performance of Deadlock-Free Dynamic Reconfiguration In High-Speed Local Area Networks

摘要

Dynamic reconfiguration in high-speed local area networks is defined as the process of changing from one routing function to another while the network remains up and running. Network-based computing systems often require the ability to reconfigure the routing algorithm to reflect changes in network topology if and when those changes occur. The process of reconfiguring a network's routing capabilities may lead to deadlock if not handled properly. In this paper; we propose efficient and deadlock-free dynamic reconfiguration technique that is generically applicable to distributed routing algorithms and networks supporting virtual channels, including those which use wormhole switching. One requirement is that the network architecture use virtual channels for deadlock-handling as well as performance purposes. The proposed technique allow messages to follow minimal paths in most cases, reducing latency and increasing throughput. Results of simulation shows that proposed reconfiguration achieves better performance than traditional ones with each network topology.