Routing Algorithms for IBM SP1
暂无分享,去创建一个
[1] Luis Gravano,et al. Routing techniques for massively parallel communication , 1991, Proc. IEEE.
[2] Viktor Prasanna,et al. Proceedings of the 6th International Parallel Processing Symposium , 1992 .
[3] Dennis G. Shea,et al. Architecture and implementation of Vulcan , 1994, Proceedings of 8th International Parallel Processing Symposium.
[4] Marshall C. Pease,et al. The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.
[5] P. Sadayappan,et al. Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes , 1988, IEEE Trans. Computers.
[6] Kang G. Shin,et al. Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability , 1992, IEEE Trans. Computers.
[7] Leonard Kleinrock,et al. Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.
[8] Suresh Chalasani,et al. A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.
[9] Bülent Abali,et al. Balanced Parallel Sort on Hypercube Multiprocessors , 1993, IEEE Trans. Parallel Distributed Syst..
[10] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[11] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[12] Tevfik Bultan,et al. A New Mapping Heuristic Based on Mean Field Annealing , 1992, J. Parallel Distributed Comput..
[13] Duncan H. Lawrie,et al. Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.