Reconfiguration of Complete Binary Trees in Full IEH Graphs and Faulty Hypercubes

The incrementally extensible hypercube (IEH) graph is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. In this paper, the authors present an efficient model to fulfill the embedding of a full binary tree into a full IEH graph. As the model the authors proposed, an algorithm is developed for the embedding with expansion 1, load 1, congestion 2, and dilation 2. Moreover, the embedding algorithm can be also applied into hypercubes with one faulty node.

[1]  Fikret Erçal,et al.  Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..

[2]  Nian-Feng Tzeng,et al.  Fast Compaction in Hypercubes , 1998, IEEE Trans. Parallel Distributed Syst..

[3]  Alan Wagner,et al.  Embedding the Complete Tree in the Hypercube , 1994, J. Parallel Distributed Comput..

[4]  Pradip K. Srimani,et al.  On the routing problem in faulty IEH graphs , 1994, Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications.

[5]  Jake K. Aggarwal,et al.  Generalized Mapping of Parallel Algorithms Onto Parallel Architectures , 1990, ICPP.

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