A survey and comparison of wormhole routing techniques in 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 led to the development of distributed computers. They consist of many processing nodes that interact by sending messages (containing both data and synchronization information) over communication links 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.