By Topic

Hamiltonian path and cycle in hypercubes with faulty links

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Latifi ; Dept. of Electr. & Comput. Eng., Nevada Univ., Las Vegas, NV, USA ; S. Q. Zheng ; N. Bagherzadeh

We show that in an n-dimensional hypercube (Q/sub n/), up to n - 1 (resp. n $2) links can fail before destroying all available Hamiltonian paths (resp. cycles). We present an efficient algorithm which identifies a characterization of a Hamiltonian path (resp. cycle) in Q/sub n/, with as many as n - 1 (resp. n - 2) faulty links, in O(n/sup 2/) time. Generating a fault-free Hamiltonian cycle from this characterization can be easily done in linear time. An important application of this work is in optimal fault-tolerant simulation of multiprocessors or multicomputer systems based on linear array ring by hypercubes. While the existing fault-tolerant ring embeddings based on link-disjoint Hamiltonian cycles can only tolerate /spl lfloor/n/2/spl rfloor/ - 1 faulty links, our algorithm specifies a fault-free Hamiltonian cycle of Q/sub n/ with twice as many faulty links.

Published in:

Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on

Date of Conference:

23-25 Oct. 2002