Fault tolerant algorithms for broadcasting on the star graph network

Fault tolerant algorithms for broadcasting on the star graph network

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/spl les/r/spl les...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lo, N.W., Carlson, B.S., Tao, D.L.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Broadcasting
Character generation
Concurrent computing
Fault tolerance
Hypercubes
Message passing
Multiprocessor interconnection
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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/spl les/r/spl les/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.
DOI:10.1109/MWSCAS.1996.593159