Concentration, load balancing, partial permutation routing, and superconcentration on cube-connected cycles parallel computers
暂无分享,去创建一个
[1] Marshall C. Pease,et al. The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.
[2] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] M. Pinsker,et al. On the complexity of a concentrator , 1973 .
[4] D. Lenoski,et al. The SGI Origin: A ccnuma Highly Scalable Server , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.
[5] Kemal Efe,et al. Embedding Mesh of Trees in the Hypercube , 1991, J. Parallel Distributed Comput..
[6] F. Chung. On concentrators, superconcentrators, generalizers, and nonblocking networks , 1979, The Bell System Technical Journal.
[7] Gene Eu Jan,et al. Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network , 1993, IEEE Trans. Computers.
[8] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[9] William J. Dally,et al. Principles and Practices of Interconnection Networks , 2004 .
[10] Ellis Horowitz,et al. Computer Algorithms / C++ , 2007 .
[11] Y.-H. Choi,et al. Unidirectional cube connected cycles , 1993 .
[12] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[13] A. Mullin,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[14] Ivan Havel,et al. Embedding the polytomic tree into the $n$-cube , 1973 .
[15] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.
[16] Sartaj Sahni,et al. Load balancing on a hypercube , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.
[17] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[18] Nian-Feng Tzeng. A Cube-Connected Cycles Architecture with High Reliability and Improved Performance , 1993, IEEE Trans. Computers.
[19] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[20] C. Y. Roger Chen,et al. Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles , 1993, IEEE Trans. Parallel Distributed Syst..
[21] Shubhendu S. Mukherjee,et al. The Alpha 21364 Network Architecture , 2002, IEEE Micro.