Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Running algorithms efficiently on faulty hypercubes (extended abstract)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Computational Aspects of VLSI
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Improved One-to-All Broadcasting Algorithms on Faulty SIMD Hypercubes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Research note: Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
Journal of Parallel and Distributed Computing
Embedding of cycles in the faulty hypercube
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
| Hi-index | 0.00 |
We consider the problem of embedding and reconfiguring binary tree structures in faulty hypercubes. We assume that the number of faulty nodes is at most (n驴2), where n is the number of dimensions of the hypercube; we further assume that the location of faulty nodes are known. Our embedding techniques are based on a key concept called free dimension, which can be used to partition a cube into subcubes such that each subcube contains at most one faulty node. Using this approach, two distributed schemes are provided for embedding and reconfiguration in faulty hypercubes. We extend the free dimension concept to degree of occupancy and use this to develop a distributed scheme for reconfiguration of binary tree in faulty hypercubes with up to $\lceil\, 3n/2\, \rceil$ node faults.