Fault-Tolerant Asynchronous Networks

Dhiraj K Pradhan; Sudhakar M Reddy

doi:10.1109/TC.1973.5009132

Back

Journal article

Peer reviewed

Fault-Tolerant Asynchronous Networks

Dhiraj K Pradhan and Sudhakar M Reddy

IEEE transactions on computers, Vol.C-22(7), pp.662-669

07/1973

DOI: 10.1109/TC.1973.5009132

View Online

Abstract

The design of fault-tolerant asynchronous networks has been an unsolved problem. In this paper, necessary and sufficient conditions on state assignments for fault-tolerant asynchronous networks are given. Three design techniques, based on Liu's 2 so - 1 assignment, Friedman et al.'s (2, 2) separating system, and (2s o + 1) assignments, are given for fault-tolerant asynchronous networks. The earlier Liu's upper bound on state variables for USTI assignment for 2 so rows is improved to 2 so - 2 so -3 .

Data Mining

Asynchronous networks

d-separation

Distance measurement

Fault tolerance

Fault tolerant systems

Hamming distance

Liu's assignment

m-fault-tolerant asynchronous sequential network

Probability density function

separating systems

Sufficient conditions

Details

Title: Subtitle: Fault-Tolerant Asynchronous Networks
Creators: Dhiraj K Pradhan - University of Iowa
Sudhakar M Reddy - University of Iowa
Resource Type: Journal article
Publication Details: IEEE transactions on computers, Vol.C-22(7), pp.662-669
Publisher: IEEE
DOI: 10.1109/TC.1973.5009132
ISSN: 0018-9340
eISSN: 1557-9956
Language: English
Date published: 07/1973
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984197346002771

Metrics

4 Record Views

3 Times Cited - Web of Science

Fault-Tolerant Asynchronous Networks

View Online

Related content

Abstract

Details

Metrics