Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
暂无分享,去创建一个
[1] 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.
[2] Parameswaran Ramanathan,et al. Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.
[3] Cauligi S. Raghavendra,et al. Broadcasting algorithms in faulty SIMD hypercubes , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.
[4] F. Harary,et al. A survey of the theory of hypercube graphs , 1988 .
[5] S. F. Nugent,et al. The iPSC/2 direct-connect communications technology , 1988, C3P.
[6] Cauligi S. Raghavendra,et al. Embedding of Multidimensional Meshes on to Faulty Hypercubes , 1991, ICPP.
[7] Cauligi S. Raghavendra,et al. Reconfiguration of Rings and Meshes in Faulty Hypercubes , 1994, J. Parallel Distributed Comput..
[8] S. Park,et al. Broadcasting in hypercubes with link/node failures , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.
[9] W. Daniel Hillis,et al. The connection machine , 1985 .
[10] John P. Hayes,et al. Designing Fault-Tolerant System Using Automorphisms , 1991, J. Parallel Distributed Comput..
[11] Bernd Becker,et al. How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[12] Tze Chiang Lee. Quick Recovery of Embedded Structures in Hypercube Computers , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..
[13] Mee Yee Chan,et al. Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..
[14] Ming-Syan Chen,et al. Depth-First Search Approach for Fault-Tolerant Routing in Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..
[15] Cauligi S. Raghavendra,et al. Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions , 1994, IEEE Trans. Computers.
[16] Cauligi S. Raghavendra,et al. Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..
[17] Frank Thomson Leighton,et al. Coding theory, hypercube embeddings, and fault tolerance , 1991, SPAA '91.
[18] Krzysztof Diks,et al. Optimal broadcasting in faulty hypercubes , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.
[19] Frank Thomson Leighton,et al. Fast computation using faulty hypercubes , 1989, STOC '89.
[20] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[21] Cauligi S. Raghavendra,et al. Embedding and reconfiguration of binary trees in faulty hypercubes , 1992, Proceedings Sixth International Parallel Processing Symposium.
[22] Rami Melhem,et al. Distributed Fault Tolerant Embedding of Binary Trees and Rings in Hypercubes , 1989 .
[23] John P. Hayes,et al. A Fault-Tolerant Communication Scheme for Hypercube Computers , 1992, IEEE Trans. Computers.
[24] Jehoshua Bruck,et al. Tolerating Faults in Hypercubes Using Subcube Partitioning , 1992, IEEE Trans. Computers.
[25] Y. Chang. Fault tolerant broadcasting in SIMD hypercubes , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.