Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
Shuo-Cheng Hu , Dept. of Appl. Math., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan
Chang-Biau Yang , Dept. of Appl. Math., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan
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(n/sup 3/ 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(n/sup 2/) if at most n-2 faults exist.
graph theory; fault tolerant computing; computational complexity; broadcasting; multiprocessor interconnection networks; star graphs; fault tolerance; multiprocessor systems; forbidden faulty set; algorithm; connectivity; time complexity; fault-tolerant routing algorithm; cycle structure; fault-tolerant broadcasting algorithm
C. Yang and S. Hu, "Fault tolerance on star graphs," Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on(PAS), Aizu-Wakamatsu, Fukushima, Japan, 1995, pp. 176.