IEEE Transactions on Computers · 1983 · 108 citations · 11 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsFault-tolerant ControlMultistage Interconnection NetworksNetwork Fault ToleranceNetwork ReliabilityNetwork RobustnessReliable System DesignControl AlgorithmsDisjoint PathsFault Tolerance MechanismsFault-tolerant Interconnection NetworksFault-tolerant NetworksNetwork RedundancyOmega NetworksRedundant Network Design
A general class of fault-tolerant multistage interconnection networks is presented, wherein fault-tolerance is achieved by providing multiple disjoint paths between every input and output. These networks are derived from the Omega networks and as such retain all the connection properties of the parent networks in the absence of faults. An R-path network in this class can tolerate (R-1) arbitrary faults in the intermediate stages of the network at a cost that is far less than providing R copies of the original network. Different techniques for constructing such networks are presented and relevant properties and control algorithms are investigated.
11
Banyan networks for partitioning multiprocessor systems
L. Rodney Goke, G. Jack Lipovski · 1998 · 512 citations