Adaptive Virtual Cut-Through as a Viable Routing Method 1
暂无分享,去创建一个
Jong Kim | Sunggu Lee | Howon Kim | Hyun Suk Lee | Sunggu Lee | Jong Kim | Howon Kim | Hyun Suk Lee
[1] Jong Kim,et al. Adaptive Virutal Cut-through as an Alternative to Wormhole Routing , 1995, ICPP.
[2] Michael C. Browne,et al. S-Connect: from networks of workstations to supercomputer performance , 1995, Proceedings 22nd Annual International Symposium on Computer Architecture.
[3] 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.
[4] Timothy Mark Pinkston,et al. Crossbar analysis for optimal deadlock recovery router architecture , 1997, Proceedings 11th International Parallel Processing Symposium.
[5] Mario Gerla,et al. Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..
[6] William J. Dally,et al. Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..
[7] William J. Dally,et al. Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.
[8] Timothy Mark Pinkston,et al. An efficient, fully adaptive deadlock recovery scheme: DISHA , 1995, ISCA.
[9] DAVID GELERNTER. A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks , 1981, IEEE Transactions on Computers.
[10] Nicholas F. Maxemchuk,et al. Problems Arising from Deflection Routing: Live-lock, Lockout, Congestion and Message Reassembly , 1991 .
[11] Timothy Mark Pinkston,et al. DISHA: a deadlock recovery scheme for fully adaptive routing , 1995, Proceedings of 9th International Parallel Processing Symposium.
[12] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[13] Kai Li,et al. Design and implementation of virtual memory-mapped communication on Myrinet , 1997, Proceedings 11th International Parallel Processing Symposium.
[14] Luis Gravano,et al. Requirements for deadlock-free, adaptive packet routing , 1992, PODC '92.
[15] A ChienAndrew. A Cost and Speed Model for k-ary n-Cube Wormhole Routers , 1998 .
[16] Lawrence Snyder,et al. The Chaos Router , 1994, IEEE Trans. Computers.
[17] Lionel M. Ni,et al. The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.
[18] Mark D. Hill,et al. A Survey of User-Level Network Interfaces for System Area Networks , 1997 .
[19] José Duato,et al. A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..
[20] Leonard Kleinrock,et al. Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.