Fault-tolerant cycle embedding in the hypercube

Authors:
Jung-Sheng Fu
Affiliations:
Department of Electronics Engineering, National Lien-Ho Institute of Technology, 1 Lien-Kung, Kung-Ching Li, Miaoli City 360, Taiwan, ROC
Venue:
Parallel Computing
Year:
2003

Citing 10
Cited 30

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-Tolerant Ring Embedding in de Bruijn Networks

IEEE Transactions on Computers
Embedding a ring in a hypercube with both faulty links and faulty nodes

Information Processing Letters
Distributed Ring Embedding in Faulty De Bruijn Networks

IEEE Transactions on Computers
Parallel computation: models and methods

Parallel computation: models and methods
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs

IEEE Transactions on Parallel and Distributed Systems
Embedding Hamiltonian cycles into folded hypercubes with faulty links

Journal of Parallel and Distributed Computing
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions

IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures

IEEE Transactions on Parallel and Distributed Systems
Embed Longest Rings onto Star Graphs with Vertex Faults

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing

Fault-Hamiltonicity of Hypercube-Like Interconnection Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes

IEEE Transactions on Parallel and Distributed Systems
Optimal Path Embedding in Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges

Parallel Computing
Longest paths and cycles in faulty hypercubes

PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Cycles embedding in hypercubes with node failures

Information Processing Letters
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes

IEEE Transactions on Parallel and Distributed Systems
Edge-bipancyclicity of a hypercube with faulty vertices and edges

Discrete Applied Mathematics
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults

Theoretical Computer Science
Long paths in hypercubes with conditional node-faults

Information Sciences: an International Journal
1-vertex-fault-tolerant cycles embedding on folded hypercubes

Discrete Applied 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
Long paths and cycles in hypercubes with faulty vertices

Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults

Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes

Information Sciences: an International Journal
Hamiltonicity of matching composition networks with conditional edge faults

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Computational complexity of long paths and cycles in faulty hypercubes

Theoretical Computer Science
Embedded paths and cycles in faulty hypercubes

Journal of Combinatorial Optimization
Efficient unicast in bijective connection networks with the restricted faulty node set

Information Sciences: an International Journal
A note on cycle embedding in hypercubes with faulty vertices

Information Processing Letters
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges

Theoretical Computer Science
Topological properties of hierarchical interconnection networks: a review and comparison

Journal of Electrical and Computer Engineering
Edge-pancyclicity of twisted cubes

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Fault-Tolerant cycle embedding in the WK-Recursive network

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Embedding of cycles in the faulty hypercube

ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Edge-bipancyclicity of all conditionally faulty hypercubes

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Long cycles in hypercubes with optimal number of faulty vertices

Journal of Combinatorial Optimization
Fault-tolerant path embedding in folded hypercubes with both node and edge faults

Theoretical Computer Science
Fault-tolerant cycle embedding in the faulty hypercubes

Information Sciences: an International Journal
Paired many-to-many disjoint path covers in faulty hypercubes

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Almost all the previous fault-tolerant cycle embedding research could not tolerate the faulty nodes more than the degree of the network. In this paper, we have broken this limitation: a recursive method of embedding a longest cycle into an n-dimensional hypercube (n-cube), which can tolerate atmost 2n- 4 faulty nodes, is proposed. The best result thus far is to tolerate only atmost n - 1 faulty nodes, which is less than the degree of the n-cube.