A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Fault tolerance on star graphs
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
The capability of fault tolerance is one of the advantages of multiprocessor systems. In this paper, we shall prove the fault tolerance of star graphs is 2n -5 shall propose an algorithm for examining the connecalgorithm requires O(n310gn) tame. Besides, we im-Bagherzadeh et al.  by calculating the cycle structure sage to a node without another nonfaulty neighbors. we shall propose an efficient fault-tolerant broadcasting algorithm. When no fault occurs, our broadcasting algorithm remainsdoi:10.1109/aispas.1995.401340 fatcat:zfwat5caznakjbvoq6pczscdw4