An evaluation of planar-adaptive routing (PAR)
暂无分享,去创建一个
[1] DAVID GELERNTER. A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks , 1981, IEEE Transactions on Computers.
[2] Alain J. Martin,et al. The architecture and programming of the Ametek series 2010 multicomputer , 1988, C3P.
[3] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.
[4] K. Gunther,et al. Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .
[5] Andrew A. Chien,et al. J-machine: A fine-grain concurrent computer , 1989 .
[6] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[7] William J. Dally,et al. Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..
[8] Lionel M. Ni,et al. The turn model for adaptive routing , 1992, ISCA '92.
[9] William J. Dally. Virtual-Channel Flow Control , 1992, IEEE Trans. Parallel Distributed Syst..
[10] Daniel H. Linder,et al. An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.
[11] Andrew A. Chien,et al. Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.
[12] S. L. Lillevik. Touchstone Program Overview , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..