The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Network-based parallel computing systems often require the ability to reconfigure the routing algorithm to reflect changes in network topology if and when voluntary or involuntary changes occur. The process of reconfiguring a network's routing capabilities may be very inefficient and/or deadlock-prone if not handled properly. In this paper, we propose efficient and deadlock-free dynamic reconfiguration schemes that are applicable to routing algorithms and networks which use wormhole, virtual cut-through, or store-and-forward switching, combined with hard link-level flow control. One requirement is that the network architecture use virtual channels or duplicate physical channels for deadlock-handling as well as performance purposes. The proposed schemes do not impede the injection, transmission, or delivery of user packets during the reconfiguration process. Instead, they provide uninterrupted service, increased availability/reliability, and improved overall quality-of-service support as compared to traditional techniques based on static reconfiguration.</p>
Deadlock-free routing, dependable communication, dynamic reconfiguration, hard link-level flow control, interconnection networks, parallel processing.

J. Duato, R. Pang and T. M. Pinkston, "Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability," in IEEE Transactions on Parallel & Distributed Systems, vol. 14, no. , pp. 780-794, 2003.
81 ms
(Ver 3.3 (11022016))