By Topic

Fault tolerance on star graphs

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

2 Author(s)
Shuo-Cheng Hu ; Dept. of Appl. Math., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; Chang-Biau Yang

Fault tolerance capability is one of the advantages of multiprocessor systems. We prove that the fault tolerance of star graphs is 2n-5 with restriction to the forbidden faulty set. We propose an algorithm for examining the connectivity of star graphs when 2n-4 faults exist. The algorithm requires O(n3 logn) time. We also improve the fault-tolerant routing algorithm proposed by Bagherzadeh et al. (1993) by calculating the cycle structure of a permutation and the avoidance of routing messages to a node without another nonfaulty neighbor. This calculation needs only constant time. We propose an efficient fault-tolerant broadcasting algorithm. When no fault occurs, our broadcasting algorithm remains optimal. The penalty is O(n2 ) if at most n-2 faults exist

Published in:

Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on

Date of Conference:

15-17 Mar 1995