Broadcasting on faulty hypercubes

In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spanning graph, consisting of n-1 edge-disjoint spanning trees of optimal height is formed. Broadcasting based on the spanning graph has an optimal bandwidth utilization and an optimal latency.

[1]  Wei-Pang Yang,et al.  Broadcasting on incomplete hypercubes , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[2]  John P. Hayes,et al.  A Fault-Tolerant Communication Scheme for Hypercube Computers , 1992, IEEE Trans. Computers.

[3]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.

[4]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[5]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[6]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[7]  Howard P. Katseff,et al.  Incomplete Hypercubes , 1988, IEEE Trans. Computers.

[8]  Shahram Latifi.  Combinatorial Analysis of the Fault-Diameter of the n-cube , 1993, IEEE Trans. Computers.

[9]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[10]  R. J. Beynon,et al.  Computers , 1985, Comput. Appl. Biosci..

[11]  Pierre Fraigniaud,et al.  Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers , 1992, IEEE Trans. Computers.