Real-time wormhole channels
暂无分享,去创建一个
[1] Heejo Lee,et al. Replicated Process Allocation for Load Distribution in Fault-Tolerant Multicomputers , 1997, IEEE Trans. Computers.
[2] H. T. Kung. Deadlock avoidance for systolic communication , 1988, ISCA '88.
[3] Jong Kim,et al. A real-time communication method for wormhole switching networks , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).
[4] Hyunsoo Yoon,et al. Throttle and preempt: a new flow control for real-time communications in wormhole networks , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).
[5] Ole Eriksen. A termination detection protocol and its formal verification , 1988 .
[6] Kang G. Shin,et al. On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..
[7] Matt W. Mutka,et al. Priority based real-time communication for large scale wormhole networks , 1994, Proceedings of 8th International Parallel Processing Symposium.
[8] William J. Dally,et al. Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..
[9] Dinesh C. Verma,et al. A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..
[10] Jong Kim,et al. Path Selection for Message Passing in a Circuit-Switched Multicomputer , 1996, J. Parallel Distributed Comput..
[11] Lars-Erik Thorelli,et al. Supporting high priority traffic in wormhole networks , 1998, Microprocess. Microsystems.
[12] José Duato,et al. 994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .
[13] Daniel H. Linder,et al. An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.
[14] Kang G. Shin,et al. Real-time communication in multi-hop networks , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.
[15] 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.
[16] A ChienAndrew. A Cost and Speed Model for k-ary n-Cube Wormhole Routers , 1998 .
[17] William J. Dally,et al. Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.
[18] Sudhakar Yalamanchili,et al. MMR: a high-performance MultiMedia Router-architecture and design trade-offs , 1999, Proceedings Fifth International Symposium on High-Performance Computer Architecture.
[19] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[20] A. A. Chein,et al. A cost and speed model for k-ary n-cube wormhole routers , 1998 .
[21] Charles L. Seitz,et al. Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.
[22] Jong Kim,et al. Adaptive Virtual Cut-Through as a Viable Routing Method 1 , 1997 .
[23] Füsun Özgüner,et al. A Priority-Driven Flow Control Mechanism for Real-Time Traffic in Multiprocessor Networks , 1998, IEEE Trans. Parallel Distributed Syst..
[24] Kang G. Shin,et al. Real-Time Communication in Multihop Networks , 1994, IEEE Trans. Parallel Distributed Syst..
[25] M. W. Mutka,et al. Using rate monotonic scheduling technology for real-time communications in a wormhole network , 1994, Second Workshop on Parallel and Distributed Real-Time Systems.