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
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Running algorithms efficiently on faulty hypercubes (extended abstract)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes
IEEE Transactions on Computers
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
Finding Hamiltonian Cycles on Incrementally Extensible Hypercube Graphs
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Embedding of meshes in Möbius cubes
Theoretical Computer Science
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Load-balance and fault-tolerance for embedding a complete binary tree in an IEH with N-expansion
WSEAS Transactions on Computers
Embedding a family of 2D meshes into Möbius cubes
WSEAS Transactions on Mathematics
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Fault-tolerant mapping of a mesh network in a flexible hypercube
WSEAS Transactions on Computers
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
Fault-tolerant meshes and tori embedded in a faulty supercube
WSEAS Transactions on Computers
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
Embedded paths and cycles in faulty hypercubes
Journal of Combinatorial Optimization
WSEAS Transactions on Information Science and Applications
On fault-tolerant embedding of meshes and tori in a flexible hypercube with unbounded expansion
WSEAS TRANSACTIONS on SYSTEMS
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Embedding of cycles in the faulty hypercube
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Long cycles in hypercubes with optimal number of faulty vertices
Journal of Combinatorial Optimization
Fault-tolerant cycle embedding in the faulty hypercubes
Information Sciences: an International Journal
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
Journal of Combinatorial Optimization
| Hi-index | 14.99 |
Fault tolerance in hypercubes is achieved by exploiting inherent redundancy and executing tasks on faulty hypercubes. The authors consider tasks that require linear chain, ring, mesh, and torus structure, which are quite useful in parallel and pipeline computations. They assume the number of faults is on the order of the number of dimensions of the hypercube. The 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. Subgraphs are embedded in each subcube and then merged to form the entire graph.