Distributed Fault-Tolerance of Tree Structures

S. H Hosseini; J. G Kuhl; S. M Reddy

doi:10.1109/TC.1987.5009481

Back

Distributed Fault-Tolerance of Tree Structures

Journal article

Peer reviewed

Distributed Fault-Tolerance of Tree Structures

S. H Hosseini, J. G Kuhl and S. M Reddy

IEEE transactions on computers, Vol.C-36(11), pp.1378-1382

11/1987

DOI: 10.1109/TC.1987.5009481

View Online

Abstract

Tree structures, as the interconnection structure in networks of many processing elements, have interesting features such as regularity ease of expansion, simple routing, simple addressing, suitability for VLSI/WSI implementation, etc. Distributed fault tolerance of these networks is considered. It is assumed that in these structures, there does not exist any central failure-free entity for providing services such as diagnosis of faulty components, system reconfiguration after failure, control, or coordination among the processing elements. Every processing element is able to diagnose the condition of every other node or internode communication paths via a truly distributed scheme.

Binary tree structure

Clustering algorithms

distributed fault-diagnosis

Fault tolerance

Fault tolerant systems

faulttolerant structure

Peer to peer computing

Silicon

Testing

VLSI/WSI implementation

Details

Title: Subtitle: Distributed Fault-Tolerance of Tree Structures
Creators: S. H Hosseini - University of Wisconsin–Milwaukee
J. G Kuhl - University of Iowa
S. M Reddy - University of Iowa
Resource Type: Journal article
Publication Details: IEEE transactions on computers, Vol.C-36(11), pp.1378-1382
Publisher: IEEE
DOI: 10.1109/TC.1987.5009481
ISSN: 0018-9340
eISSN: 1557-9956
Language: English
Date published: 11/1987
Academic Unit: Electrical and Computer Engineering; Public Policy Center (Archive)
Record Identifier: 9984197437002771

Metrics

23 Record Views

7 Times Cited - Web of Science