Communications of the ACM - Special section on computer architecture
Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Embedding large complete binary trees in hypercubes with load balancing
Journal of Parallel and Distributed Computing
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Reconfiguration of Complete Binary Trees in Full IEH Graphs and Faulty Hypercubes
International Journal of High Performance Computing Applications
A parallel algorithm for interpolation in pancake graph
SEPADS'07 Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Incrementally extensible hypercube networks and their fault tolerance
Mathematical and Computer Modelling: An International Journal
Fault-tolerant mapping of a mesh network in a flexible hypercube
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic communication pattern. The communication pattern graph is embedded in the topology of multiprocessor structures so that the corresponding application can be executed. This paper presents strategies for reconfiguring a complete binary tree in a faulty Incrementally Extensible Hypercube (IEH) with N-expansion. This embedding algorithm show a complete binary tree can be embedded in a faulty IEH with dilation 4, load 1, and congestion 1 such that O(n2-h2) faults can be tolerated, where n is the dimension of IEH and (h-1) is the height of a complete binary tree. Furthermore, the presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible. According to the result, we can embed the parallel algorithms developed by the structure of complete binary tree in an IEH. This methodology of embedding enables extremely high-speed parallel computation.