A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Cayley Graphs With Optimal Fault Tolerance
IEEE Transactions on Computers
On the fault-diameter of the star graph
Information Processing Letters
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
Optimal broadcasting on incomplete star graph interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 14.98 |
Fault tolerant algorithms are presented for broadcasting on the star graph. In our algorithm, fault tolerance is achieved by constructing an isomorphism of the star network, such that the faulty nodes minimally disrupt the message passing sequence. It is shown that, in the presence of r (1 驴r驴k驴 2) faults, at most r extra steps are required by our algorithm to perform a one-to-all broadcasting in the k-star network. Our algorithm has the same time complexity as an optimal broadcasting algorithm, and, since it takes advantage of the hierarchical nature of the star graph network, it can be implemented easily. Our algorithm can also be used to perform all-to-all broadcasting in a faulty star graph.