IEEE Transactions on Computers · 1984 · 51 citations · 10 references
EngineeringComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingInterconnection NetworksCrossbar NetworksFault ModelingHardware Fault ToleranceNetwork TheoryNetwork TopologyReliable System DesignCrossbar SwitchesCrossbar SwitchingFault Model AnalysisFault Tolerance MechanismsFault-tolerant Interconnection NetworksFault-tolerant InterconnectsFault-tolerant NetworksNetwork Fault Models
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.
10
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
Narsingh Deo · Networks · 1975 · 1.3K citations
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations
Matching, Euler tours and the Chinese postman
Jack Edmonds, Ellis L. Johnson · Mathematical Programming · 1973 · 987 citations
A Survey of Interconnection Networks
Tse-Yun Feng · Computer · 1981 · 796 citations