Reliable broadcasting in faulty hypercube computers

Author

Wu, Jie ; Fernandez, Eduardo B.

Author_Institution

Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA

fYear

1992

fDate

5-7 Oct 1992

Firstpage

122

Lastpage

129

Abstract

A nonredundant broadcasting algorithm for faulty hypercube computers is proposed. The concept of unsafe nodes is introduced to identify those nonfaulty nodes that will cause a detour or backtracking because of their proximity to faulty nodes. It is assumed that each healthy node, safe or unsafe, knows the status of all the neighboring nodes. The broadcasting is optimal, meaning that a message is sent to each node via a Hamming distance path if the broadcasting is initiated from a safe node. It is also shown that when the source node is unsafe and there is an adjacent safe node, then the broadcasting can be achieved with only one more time step than the fault-free case

Keywords

fault tolerant computing; hypercube networks; software reliability; Hamming distance path; adjacent safe node; backtracking; fault-free case; faulty hypercube computers; nonfaulty nodes; nonredundant broadcasting algorithm; source node; unsafe nodes; Broadcasting; Casting; Computer science; Fault diagnosis; Fault tolerance; Hamming distance; Hypercubes; Reliability engineering; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Reliable Distributed Systems, 1992. Proceedings., 11th Symposium on

Conference_Location

Houston, TX

Print_ISBN

0-8186-2890-1

Type

conf

DOI

10.1109/RELDIS.1992.235135

Filename

235135