Reconfiguration of binary trees in faulty hypercubes
暂无分享,去创建一个
[1] Tze Chiang Lee. Quick Recovery of Embedded Structures in Hypercube Computers , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..
[2] Angela Y. Wu,et al. Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..
[3] Cauligi S. Raghavendra,et al. Reconfiguring embedded task graphs in faulty hypercubes by automorphisms , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.
[4] Sartaj Sahni,et al. Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.
[5] S. F. Nugent,et al. The iPSC/2 direct-connect communications technology , 1988, C3P.
[6] Prithviraj Banerjee. Strategies for reconfiguring hypercubes under faults , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.
[7] Frank Thomson Leighton,et al. Reconfiguring a hypercube in the presence of faults , 1987, STOC.
[8] Rami Melhem,et al. Distributed Fault Tolerant Embedding of Binary Trees and Rings in Hypercubes , 1989 .
[9] Roy M. Jenevein,et al. Scaleability of a Binary Tree on a Hypercube , 1986, ICPP.
[10] Jehoshua Bruck,et al. Running algorithms efficiently on faulty hypercubes , 1990, SPAA '90.
[11] Ilse C. F. Ipsen,et al. How to Embed Trees in Hypercubes. , 1985 .
[12] 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.
[13] Wei-Tek Tsai,et al. An efficient multi-dimensional grids reconfiguration algorithm on hypercube , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.
[14] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.