Fault tolerance of beta-networks in interconnected multicomputer systems
Fault tolerance of beta-networks in interconnected multicomputer systems
Graphs and Hypergraphs
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
A Survey of Interconnection Networks
Computer
A study of the data commutation problems in a self-repairable multiprocessor
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A connecting network with fault tolerance capabilities
IEEE Transactions on Computers - The MIT Press scientific computation series
Fault-Tolerant Single-Stage Interconnectiohl Networks
IEEE Transactions on Computers
Performance analysis and fault tolerance of randomized routing on Clos networks
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
| Hi-index | 14.98 |
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.