Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Information and Computation
On Embedding Rectangular Grids in Hypercubes
IEEE Transactions on Computers
Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Dynamic tree embeddings in butterflies and hypercubes
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Embedding meshes in Boolean cubes by graph decomposition
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Embedding trees in a hypercube is NP-complete
SIAM Journal on Computing
Running algorithms efficiently on faulty hypercubes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Embedding of grids into optimal hypercubes
SIAM Journal on Computing
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Simulating Binary Trees on Hypercubes
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Mathematical and Computer Modelling: An International Journal
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Hi-index | 0.00 |
We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an $(n - 1)$-tree (a full binary tree with $2^{n-1} - 1$ nodes) into an $n$-cube (a hypercube with $2^n$ nodes) with unit dilation and load. For the problem where the root of the tree must be mapped to a specified hypercube node (specified root embedding problem), we show that up to $n - 2$ (node or edge) faults can be tolerated. This result is optimal in the following sense: 1) it is time-optimal, 2) $(n - 1)$-tree is the largest full binary tree that can be embedded in an $n$-cube, and 3) $n - 2$ faults is the maximum number of worst-case faults that can be tolerated in the specified root problem. Furthermore, we also show that any algorithm for this problem cannot be totally recursive in nature. For the problem where the root can be mapped to any nonfaulty hypercube node (variable root embedding problem), we show that up to $2n - 3 - \lceil\log n\rceil$ faults can be tolerated. Thus we have improved upon the previous result of $n - 1 - \lceil\log n \rceil.$ In addition, we show that the algorithm for the variable root embedding problem is optimal within a class of algorithms called recursive embedding algorithms as far as the number of tolerable faults is concerned. Finally, we show that when an $O(1/\sqrt{n})$ fraction of nodes in the hypercube are faulty, it is not always possible to have an $O(1)$-load variable root embedding no matter how large the dilation is.Index Terms驴Embedding, hypercubes, full binary trees, dilation, simulation, faulty architecture.