DocumentCode
310319
Title
Fault tolerant algorithms for broadcasting on the star graph network
Author
Lo, N.W. ; Carlson, Bradley S. ; Tao, D.L.
Author_Institution
Dept. of Electr. Eng., State Univ. of New York, Stony Brook, NY, USA
Volume
3
fYear
1996
fDate
18-21 Aug 1996
Firstpage
1289
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 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 L-star network. Our algorithm has the same time complexity as an optimal algorithm
Keywords
computational complexity; fault tolerant computing; message passing; multiprocessor interconnection networks; L-star network; fault tolerant algorithms; isomorphism; message passing sequence; multiprocessor interconnection; one-to-all broadcasting; star graph network; time complexity; Broadcasting; Character generation; Concurrent computing; Fault tolerance; Hypercubes; Message passing; Multiprocessor interconnection;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996., IEEE 39th Midwest symposium on
Conference_Location
Ames, IA
Print_ISBN
0-7803-3636-4
Type
conf
DOI
10.1109/MWSCAS.1996.593159
Filename
593159
Link To Document