On fault-tolerant embedding of Hamiltonian cycles, linear arrays and rings in a Flexible Hypercube
暂无分享,去创建一个
[1] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[2] Cauligi S. Raghavendra,et al. Reconfiguring embedded task graphs in faulty hypercubes by automorphisms , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.
[3] Cauligi S. Raghavendra,et al. Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions , 1994, IEEE Trans. Computers.
[4] Huan-Chao Keh,et al. Finding Hamiltonian cycles on incrementally extensible hypercube graphs , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.
[5] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[6] S. Lennart Johnsson,et al. On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes , 1995, IEEE Trans. Computers.
[7] Jian-Xin Chen,et al. The Flexible Hypercube: A New Fault-Tolerant Architecture for Parallel Computing , 1996, J. Parallel Distributed Comput..
[8] Frank Thomson Leighton,et al. Reconfiguring a hypercube in the presence of faults , 1987, STOC.
[9] Rami G. Melhem,et al. A Distributed Algorithm for Embedding Trees in Hypercubes with Modifications for Run-Time Fault Tolerance , 1992, J. Parallel Distributed Comput..
[10] John P. Hayes,et al. An automorphic approach to the design of fault-tolerant multiprocessors , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.