A new look at fault-tolerant network routing
Information and Computation
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Fault tolerance in hypercube-derivative networks
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
Running algorithms efficiently on faulty hypercubes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
On optimal broadcasting in faulty hypercubes
Proceedings of the international workshop on Broadcasting and gossiping 1990
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
A Low-Cost Fault-Tolerant Structure for the Hypercube
The Journal of Supercomputing
The maximum dimensional fault-free subcube allocatable in faulty hypercube
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Fault-Free pairwise independent hamiltonian paths on faulty hypercubes
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Embedding of cycles in the faulty hypercube
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Hi-index | 14.98 |
We consider the problem of embedding a cube-connected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a list of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because ascend-descend algorithms can be implemented efficiently on a CCC, this embedding enables the implementation of ascend-descend algorithms, such as bitonic sort, on hypercubes with edge faults. We also present a number of related results, including an algorithm for embedding a CCC into a hypercube with edge and node faults and an algorithm for embedding a spanning torus into a hypercube with edge faults.