Introduction to routing in multicomputer networks
ACM SIGARCH Computer Architecture News
IEEE Transactions on Computers
Performance Analysis of Wormhole Switching with Adaptive Routing in a Two-Dimensional Torus
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
The Effect of Virtual Channel Organization on the Performance of Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15
A survey of research and practices of Network-on-chip
ACM Computing Surveys (CSUR)
A deadlock detection mechanism for true fully adaptive routing in regular wormhole networks
Computer Communications
A multi-core debug platform for NoC-based systems
Proceedings of the conference on Design, automation and test in Europe
Efficient Deadlock Detection in Parallel Computer Systems with Wormhole Routing
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Scalable hardware support for conditional parallelization
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
Hi-index | 0.00 |
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