Generic methodologies for deadlock-free routing
暂无分享,去创建一个
[1] Chita R. Das,et al. A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes , 1993, 1993 International Conference on Parallel Processing - ICPP'93.
[2] José Duato,et al. A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..
[3] William J. Dally,et al. Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..
[4] Dharma P. Agrawal,et al. Efficient deadlock-free wormhole routing in shuffle based networks , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.
[5] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[6] Dharma P. Agrawal,et al. A novel deadlock-free routing technique for a class of de Bruijn graph based networks , 1995, Proceedings of 9th International Parallel Processing Symposium.
[7] Lionel M. Ni,et al. The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.
[8] Xiaola Lin,et al. The Message Flow Model for Routing in Wormhole-Routed Networks , 1995, IEEE Trans. Parallel Distributed Syst..
[9] Daniel H. Linder,et al. An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.