Dynamically scaling system area networks

New network components joining running system area networks can require communication path reconfigurations. We present a novel efficient algorithm to dynamically reconfigure the network with an arbitrary topology, for the case of newly joining node. We define a restoration graph which overcomes the restriction of the up/down algorithm. We obtain an upper bound in terms of the number of messages generated in order to reconfigure the network. The termination and the liveness properties of the proposed algorithm are proven. The validation and performance improvement of the system area network (SAN) with the proposed algorithm in comparison to the up/down algorithm is presented.

[1]  Dimiter R. Avresky,et al.  Performance Modeling of ServerNet™ SAN Topologies , 2004, The Journal of Supercomputing.

[2]  José Duato,et al.  Fast dynamic reconfiguration in irregular networks , 2000, Proceedings 2000 International Conference on Parallel Processing.

[3]  José Duato,et al.  Dynamic Reconfiguration in High Speed Local Area Networks , 2000 .

[4]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[5]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[6]  Norbert Podhorszki,et al.  Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing , 2002 .

[7]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[8]  Dimiter R. Avresky,et al.  Dynamically scaling computer networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[9]  L. Young,et al.  Performance modeling of ServerNet topologies , 1996, Proceedings of International Conference on Parallel Processing.

[10]  Federico Silla,et al.  High-Performance Routing in Networks of Workstations with Irregular Topology , 2000, IEEE Trans. Parallel Distributed Syst..

[11]  Robert W. Horst.  TNet: A Reliable System Area Network , 1995, IEEE Micro.

[12]  Hsin-Chou Chi,et al.  A deadlock-free routing scheme for interconnection networks with irregular topologies , 1997, Proceedings 1997 International Conference on Parallel and Distributed Systems.

[13]  Lionel M. Ni,et al.  Adaptive routing in irregular networks using cut-through switches , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.