A Multicast Path Algorithm on Hypercube Interconnection Networks
暂无分享,去创建一个
[1] Jianer Chen,et al. Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results , 2002, IEEE Trans. Computers.
[2] David F. Heidel,et al. An Overview of the BlueGene/L Supercomputer , 2002, ACM/IEEE SC 2002 Conference (SC'02).
[3] Junming Xu. Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.
[4] Viktor K. Prasanna,et al. Efficient collective communication in distributed heterogeneous systems , 2003, J. Parallel Distributed Comput..
[5] Y. Lan,et al. Distributed multi-destination routing in hypercube multiprocessors , 1988, C3P.
[6] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[7] Frank Harary,et al. Graph Theory , 2016 .
[8] William J. Dally,et al. Principles and Practices of Interconnection Networks , 2004 .
[9] Massimo Bernaschi,et al. MPI collective communication operations on large shared memory systems , 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.
[10] Chang-Biau Yang,et al. Multicast Algorithms for Hypercube Multiprocessors , 2001, J. Parallel Distributed Comput..
[11] R. Graham,et al. Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time , 1982 .
[12] Xiaola Lin,et al. Multicast Communication in Multicomputer Networks , 1993, ICPP.
[13] Sudhakar Yalamanchili,et al. Interconnection Networks: An Engineering Approach , 2002 .