论文信息 - A comparison of different wormhole routing schemes

A comparison of different wormhole routing schemes

Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N/spl times/N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement.<<ETX>>

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

[2] Andrew A. Chien,et al. Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

[3] S. Konstantinidou,et al. Chaos router: architecture and performance , 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.

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

[5] Philip K. McKinley,et al. MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors , 1993, MASCOTS.

[6] Leonard Kleinrock,et al. Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[7] Suresh Chalasani,et al. A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

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

[9] Luis Gravano,et al. Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks , 1994, IEEE Trans. Parallel Distributed Syst..

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

[11] William J. Dally. Virtual-channel flow control , 1990, ISCA '90.