Wirelength of Enhanced Hypercubes into r-Rooted Complete Binary Trees

One of the central issues in designing and evaluating an interconnection network is to find out its ability to execute parallel algorithms developed for one network into another with minimum time delay. Solving the wirelength problem helps in minimizing the time delay in execution. The binary hypercube is one of the most popular interconnection networks since it has a simple structure and is easy to implement. The enhanced hypercube is an important variant of hypercube with a smaller diameter, improvised mean node distance and cost efficiency when compared to a binary hypercube. In this paper we consider the problem of embedding enhanced hypercubes into r-rooted complete binary trees for minimizing the wirelength.