Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
Characterization of Deadlocks in Interconnection Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks
HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Improving Routing Performance in Myrinet Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
The Double Scheme: Deadlock-free Dynamic Reconfiguration of Cut-Through Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Fast Dynamic Reconfiguration in Irregular Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
| Hi-index | 0.01 |
NOWs executing multimedia and real-time applications need to handle dynamic changes in their irregular topologies. This may be carried out in two ways: statically and dynamically. In the former, user traffic is stopped, causing latencies to increase dramatically. In the latter, user traffic is not stopped but deadlocks may appear in the transition phase between the old and the new routing function. To solve this problem, dynamic reconfiguration methods based on deadlock avoidance have been proposed. However, another possibility not studied yet, is to use dynamic reconfiguration allowing deadlock formation with an efficient detection/ recovery mechanism. It is necessary to know deadlock frequency during the reconfiguration process in order to assess the viability of this alternative proposal. In this paper, we show that deadlocks may become very infrequent with few virtual channels and the lost message problem can be reduced by using a simple misrouting technique.