Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes
暂无分享,去创建一个
[1] Prithviraj Banerjee,et al. Distributed algorithms for shortest-path, deadlock-free routing and broadcasting in arbitrarily faulty hypercubes , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.
[2] S. Lennart Johnsson,et al. Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.
[3] Cauligi S. Raghavendra,et al. Free dimensions-an effective approach to achieving fault tolerance in hypercube , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.
[4] Cauligi S. Raghavendra,et al. Optimal Self-Routing of Linear-Complement Permutations in Hypercubes , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..
[5] Bernd Becker,et al. How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Parameswaran Ramanathan,et al. Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.
[7] Ming-Syan Chen,et al. Depth-First Search Approach for Fault-Tolerant Routing in Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..
[8] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[9] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[10] Cauligi S. Raghavendra,et al. Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..
[11] F. Harary,et al. A survey of the theory of hypercube graphs , 1988 .
[12] W. Daniel Hillis,et al. The connection machine , 1985 .
[13] Fikret Erçal,et al. Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..