Reconfiguration of Complete Binary Trees in Full IEH Graphs and Faulty Hypercubes
暂无分享,去创建一个
[1] Fikret Erçal,et al. Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..
[2] Nian-Feng Tzeng,et al. Fast Compaction in Hypercubes , 1998, IEEE Trans. Parallel Distributed Syst..
[3] Alan Wagner,et al. Embedding the Complete Tree in the Hypercube , 1994, J. Parallel Distributed Comput..
[4] Pradip K. Srimani,et al. On the routing problem in faulty IEH graphs , 1994, Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications.
[5] Jake K. Aggarwal,et al. Generalized Mapping of Parallel Algorithms Onto Parallel Architectures , 1990, ICPP.
[6] S. Lennart Johnsson,et al. Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..