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

Authors:
Jen-Chih Lin;Huan-Chao Keh
Affiliations:
Department of Information Management, Jin-Wen Institute of Technology, Hsinten, Taipei, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, Tamkang University, Tamsui, Taipei, Taiwan, R.O.C.
Venue:
International Journal of High Performance Computing Applications
Year:
2001

Citing 3
Cited 1

Communication effect basic linear algebra computations on hypercube architectures

Journal of Parallel and Distributed Computing
Embedding the complete tree in the hypercube

Journal of Parallel and Distributed Computing
Fast Compaction in Hypercubes

IEEE Transactions on Parallel and Distributed Systems

Load-balance and fault-tolerance for embedding a complete binary tree in an IEH with N-expansion

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.