A survey and comparison of wormhole routing techniques in a mesh networks

The growing demand for high processing power in various scientific and engineering applications has made multiprocessing architectures increasingly popular. These multiprocessing systems consist of processing elements or nodes which are connected together by interconnection networks in various topologies. One of the design methodologies used for parallel machines has fed to the development of distributed memory message-passing concurrent computers, commonly known as multicomputers. They consist of many processing nodes that interact by sending messages (containing both data and synchronization information) over a communication link, between nodes. Thus, efficient communication in multicomputers is one of the important research areas in parallel computing today, and it depends on the underlying scheme for routing. For this reason it is essential to know which routing techniques are suitable and practical. Although an extremely wide number of routing algorithms have been proposed and implemented in hardware and software, it is difficult for the designer of a multicomputer to choose the best routing algorithm given a particular architectural configuration. In an attempt to overcome this difficulty, we present a survey and comparison of wormhole routing techniques in mesh interconnection networks. The mesh topology is important because of its scalability. Moreover, it has already been implemented in many commercial multicomputers.

[1]  Richard M. Fujimoto,et al.  Multicomputer Networks: Message-Based Parallel Processing , 1987 .

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

[3]  Charles L. Seitz,et al.  Multicomputers: message-passing concurrent computers , 1988, Computer.

[4]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[5]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[6]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[7]  Sivarama P. Dandamudi,et al.  Hierarchical hypercube multicomputer interconnection networks , 1991 .

[8]  Chita R. Das,et al.  Modeling wormhole routing in a hypercube , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[9]  Anant Agarwal,et al.  Limits on Interconnection Network Performance , 1991, IEEE Trans. Parallel Distributed Syst..

[10]  A. L. Narasimha Reddy,et al.  Fault tolerance of adaptive routing algorithms in multicomputers , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[11]  William J. Dally,et al.  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  Sudhakar Yalamanchili,et al.  Adaptive routing protocols for hypercube interconnection networks , 1993, Computer.

[13]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[14]  W.-J. Guan,et al.  An analytical model for wormhole routing in multicomputer interconnection networks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[15]  Xiaola Lin,et al.  The Message Flow Model for Routing in Wormhole-Routed Networks , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[16]  Kang G. Shin,et al.  Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[17]  Joydeep Ghosh,et al.  A Comprehensive Analytical Model for Wormhole Routng in Multicomputer Systems , 1994, J. Parallel Distributed Comput..

[18]  Yen-Wen Lu,et al.  A comparison of different wormhole routing schemes , 1994, Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[19]  José Duato,et al.  A theory of fault-tolerant routing in wormhole networks , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[20]  Chita R. Das,et al.  Hypercube Communication Delay with Wormhole Routing , 1994, IEEE Trans. Computers.

[21]  Chita R. Das,et al.  Fault-Tolerant Routing in Mesh Networks , 1995, International Conference on Parallel Processing.

[22]  Suresh Chalasani,et al.  Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks , 1995, IEEE Trans. Computers.

[23]  Loren Schwiebert,et al.  Optimal Fully Adaptive Minimal Wormhole Routing for Meshes , 1995, J. Parallel Distributed Comput..

[24]  Xiaola Lin,et al.  The Message Flow Model for Routing in Wormhole-Routed Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[25]  Lionel M. Ni,et al.  The turn model for adaptive routing , 1998, ISCA '98.

[26]  Andrew A. Chien,et al.  A Cost and Speed Model for k-ary n-Cube Wormhole Routers , 1998, IEEE Trans. Parallel Distributed Syst..

[27]  A. A. Chein,et al.  A cost and speed model for k-ary n-cube wormhole routers , 1998 .