Comparison of Multiplexing Schemes for Wormhole-Routed Networks
暂无分享,去创建一个
[1] José Duato. Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[2] Loren Schwiebert,et al. Optimal fully adaptive wormhole routing for meshes , 1993, Supercomputing '93. Proceedings.
[3] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[4] William J. Dally. Virtual-channel flow control , 1990, ISCA '90.
[5] Andrew A. Chien,et al. A Cost and Speed Model for k-ary n-Cube Wormhole Routers , 1998, IEEE Trans. Parallel Distributed Syst..
[6] D. N. Jayasimha,et al. Measures of Message Latency for Wormhole Routed Networks , 1994 .
[7] Andrew A. Chien,et al. The Cost of Adaptivity and Virtual Lanes in aWormhole Router , 1995 .
[8] Lionel M. Ni,et al. A survey of wormhole routing techniques in direct networks , 1993, Computer.