loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 International Conference on Parallel Processing (ICPP'03)
A Methodology for Developing Dynamic Network Reconfiguration Processes
Kaohsiung, Taiwan
October 06-October 09
ISBN: 0-7695-2017-0
Olav Lysne, Simula Research Laboratory
Timothy Mark Pinkston, EE-Systems Dept., USC
Jose Duato, Technical Univ. of Valencia, Spain
Dynamic network reconfiguration is defined as the change from one routing function to another while the network is up and running. The main challenge is avoidance of deadlocks, while keeping restrictions on packet injection and forwarding minimal. Current approaches either require virtual channels in the network, or they work only for a limited set of routing algorithms. In this paper, we present a methodology for devising deadlock free and dynamic transitions between an old and a new routing function. The methodology is independent of topology and puts no restrictions on either routing function. Furthermore, it does not require any virtual channels to guarantee deadlock freedom. This research is motivated by the current trend toward using increasingly larger Internet servers based on clusters of PCs and the very high availability requirements of those as well as other local, system, and storage area network-based systems.
Index Terms:
Deadlock-free routing, dynamic network reconfiguration, interconnection network architecture, highly-available and highly-dependable network-based systems
Citation:
Olav Lysne, Timothy Mark Pinkston, Jose Duato, "A Methodology for Developing Dynamic Network Reconfiguration Processes," icpp, pp.77, 2003 International Conference on Parallel Processing (ICPP'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.