On Constructing Multiple Spanning Trees in a Hypercube

Abstract Simple formulas are derived to construct inorder spanning trees in a hypercube network. We identify a routing strategy to ensure the edge-disjointness of the routing paths in executing binary tree algorithms. Large trees can be built in a small hypercube by spreading the load congestion uniformly across the nodes of the hypercube. We also discuss the fault tolerance of the embedding method.

[1]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[2]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[3]  R. M. Chamberlain,et al.  Gray codes, Fast Fourier Transforms and hypercubes , 1988, Parallel Comput..

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

[5]  Anthony P. Reeves,et al.  Solving Nonuniform Problems on SIMD Computers: Case Study on Region Growing , 1990, J. Parallel Distributed Comput..

[6]  Kemal Efe,et al.  Congestion and fault tolerance of binary tree embeddings on hypercube , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[7]  S. Sitharama Iyengar,et al.  A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees , 1985, IEEE Transactions on Computers.

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

[9]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.