This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault Tolerant Algorithms for Broadcasting on the Star Graph Network
December 1997 (vol. 46 no. 12)
pp. 1357-1362
ASCII Text
x 
 
N.w. Lo, Bradley S. Carlson, D.l. Tao, "Fault Tolerant Algorithms for Broadcasting on the Star Graph Network," IEEE Transactions on Computers, vol. 46, no. 12, pp. 1357-1362, December, 1997.
 
 
BibTex
x
 
@article{ 10.1109/12.641935,
author = {N.w. Lo and Bradley S. Carlson and D.l. Tao},
title = {Fault Tolerant Algorithms for Broadcasting on the Star Graph Network},
journal ={IEEE Transactions on Computers},
volume = {46},
number = {12},
issn = {0018-9340},
year = {1997},
pages = {1357-1362},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.641935},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Fault Tolerant Algorithms for Broadcasting on the Star Graph Network
IS - 12
SN - 0018-9340
SP1357
EP1362
EPD - 1357-1362
A1 - N.w. Lo,
A1 - Bradley S. Carlson,
A1 - D.l. Tao,
PY - 1997
KW - Fault tolerance
KW - star graph
KW - parallel and distributed computing
KW - multiprocessor systems
KW - interconnection network.
VL - 46
JA - IEEE Transactions on Computers
ER -
 

Abstract—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.

[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.
[2] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389-396, July 1992.
[3] S.B. Akers and B. Krishnamurthy, "The Fault Tolerance of Star Graphs," Proc. Second Int'l Conf. Supercomputing, 1987.
[4] S. Latifi, “On the Fault-Diameter of the Star Graph,” Information Processing Letters, vol. 46, pp. 143-150, June 1993.
[5] P.K. Srimani, "Generalized Fault Tolerance Properties of Star Graphs," Technical Report CS-90-104, Dept. of Computer Science, Colorado State Univ., 1990.
[6] N. Bagherzadeh, N. Nassif, and S. Latifi, “A Routing and Broadcasting Scheme on Faulty Star Graphs,” IEEE Trans. Computers, vol. 42, no. 11, pp. 1,398-1,403, Nov. 1993.
[7] N. Sur and P.K. Srimani, "A Fault Tolerant Routing Algorithm in Star Graph Interconnection Networks," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 267-270, 1991.
[8] P. Fragopoulou and S.G. Akl, “Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance,” IEEE Trans. Computers, vol. 45, no. 2, pp. 174-185, Feb. 1996.
[9] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[10] B. Alspach, "Cayley Graphs with Optimal Fault Tolerance," IEEE Trans. Computers, vol. 41, no. 10, pp. 1,337-1,339, Oct. 1992.
[11] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embedding of Cycles and Grids in Star Graphs," J. Circuits, Systems, and Computers, vol. 1, no. 1, pp. 43-74, 1991.

Index Terms:
Fault tolerance, star graph, parallel and distributed computing, multiprocessor systems, interconnection network.
Citation:
N.w. Lo, Bradley S. Carlson, D.l. Tao, "Fault Tolerant Algorithms for Broadcasting on the Star Graph Network," IEEE Transactions on Computers, vol. 46, no. 12, pp. 1357-1362, Dec. 1997, doi:10.1109/12.641935
Usage of this product signifies your acceptance of the Terms of Use.