DocumentCode
1150260
Title
Fault-Tolerance of Dynamic-Full-Access Interconnection Networks
Author
Shen, John Paul ; Hayes, John P.
Author_Institution
Department of Electrical and Computer Engineering, Carnegie-Mellon University
Issue
3
fYear
1984
fDate
3/1/1984 12:00:00 AM
Firstpage
241
Lastpage
248
Abstract
A β-network is an interconnection network composed of 2 ×2 crossbar switches called β-elements. This paper presents an analysis of the fault-tolerance of β-networks. A fault model is specified which allows β-elements to be stuck in either of their two normal states. A new connectivity property called dynamic full access (DFA) is introduced which serves as the criterion for fault tolerance. A fault is called critical if it destroys the DFA property; otherwise, it is noncritical. A minimal critical fault (MCF) is a critical fault none of whose proper subsets constitutes a critical fault. Two graph-theoretical characterizations of the minimal critical faults and the noncritical faults of a β-network are presented. Some applications of the theory developed here are discussed.
Keywords
Eulerian graphs; fault diagnosis; fault-tolerance; interconnection networks; parallel processing; Computer networks; Contracts; Doped fiber amplifiers; Electrical fault detection; Fault diagnosis; Fault tolerance; Multiprocessor interconnection networks; Parallel processing; Switches; Eulerian graphs; fault diagnosis; fault-tolerance; interconnection networks; parallel processing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1984.1676421
Filename
1676421
Link To Document