By Topic

Distributed fault-tolerant ring embedding and reconfiguration in hypercubes

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
$31 $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

2 Author(s)
Yuh-Rong Leu ; Inst. for Inf. Ind., Commun. Network Lab., Taipei, Taiwan ; Sy-Yen Kuo

To embed a ring in a hypercube is to find a Hamiltonian cycle through every node of the hypercube. It is obvious that no 2n-node Hamiltonian cycle exists in an n-dimensional faulty hypercube which has at least one faulty node. However, if a hypercube has faulty links only and the number of faulty links is at most n-2, at least one 2n-node Hamiltonian cycle can be found. In this paper, we propose a distributed ring-embedding algorithm that can find a Hamiltonian cycle in a fault-free or faulty n-dimensional hypercube (Q,), and the complexity is O(n) parallel steps. The algorithm is based on the recursion property of the hypercube and the free-link dimension concept. In some cases, even when the number of faulty links is larger than n-2, Hamiltonian cycles may still exist. We show that the largest possible number of faulty links that can be tolerated is 2n-1-1. The performance and the constraints of the fault-tolerant algorithm is also analyzed in detail in this paper. Furthermore, a dynamic reconfiguration algorithm for an embedded ring is proposed and discussed. Due to the distributed nature of the algorithms, they are useful for the simulation of ring-based multiprocessors on MIMD hypercube multiprocessors

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 1 )